AMAS: optimizing the partition and filtration of adaptive seeds to speed up read mapping
Background: Identifying all possible mapping locations of next-generation sequencing (NGS) reads is highly essential in several applications such as prediction of genomic variants or protein binding motifs located in repeat regions, isoform expression quantification, metagenomics analysis, etc. However, this task is very time-consuming and majority of mapping tools only focus on one or a few best mapping locations. Results: We propose AMAS, an alignment tool specialized in identifying all possible mapping locations of NGS reads in a reference sequence. AMAS features an effective use of adaptive seeds to speed up read mapping while preserving sensitivity. Specifically, an index is designed to pre-store the locations of adaptive seeds in the reference sequence, efficiently reducing the time for seed matching and partitioning. An accurate filtration of adaptive seeds is further applied to substantially tighten the candidate alignment space. As a result, AMAS runs several times faster than other state-of-the-art read mappers while achieving similar accuracy. Conclusions: AMAS provides a valuable resource to speed up the important yet time-consuming task of identifying all mapping locations of NGS reads. AMAS is implemented in C++ based on the SeqAn library and is freely available at https://sourceforge.net/projects/ngsamas/. Keywords: next-generation sequencing, read mapping, sequence alignment, adaptive seeds, seed partition, filtration
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Analysing Multiscale Clusterings with Persistent Homology
In data clustering, it is often desirable to find not just a single partition into clusters but a sequence of partitions that describes the data at different scales (or levels of coarseness). A natural problem then is to…
ClusteringTopological Data AnalysisAdaptive Partial Differential Equation Learning for Visual Saliency Detection
Partial Differential Equations (PDEs) have been successful in solving many low-level vision tasks. However, it is a challenging task to directly utilize PDEs for visual saliency detection due to the difficulty in incorpo…
Saliency DetectionAn Efficient Method of Partitioning High Volumes of Multidimensional Data for Parallel Clustering Algorithms
An optimal data partitioning in parallel & distributed implementation of clustering algorithms is a necessary computation as it ensures independent task completion, fair distribution, less number of affected points and b…
ClusteringMCbiF: Measuring Topological Autocorrelation in Multiscale Clusterings via 2-Parameter Persistent Homology
Datasets often possess an intrinsic multiscale structure with meaningful descriptions at different levels of coarseness. Such datasets are naturally described as multi-resolution clusterings, i.e., not necessarily hierar…
Representation LearningAdaptive Topological Feature via Persistent Homology: Filtration Learning for Point Clouds
Machine learning for point clouds has been attracting much attention, with many applications in various fields, such as shape recognition and material science. For enhancing the accuracy of such machine learning methods,…