deBGA
Computational Tool
FAIR Metrics
0 evaluations
General Information
DescriptionRead alignment with de Bruijn graph-based seed and extension
Homepagehttps://github.com/hitbc/deBGA
Publications
deBGA: read alignment with de Bruijn graph-based seed and extension
Bo Liu; Hongzhe Guo; Michael Brudno; Yadong Wang
Motivation: As high-throughput sequencing (HTS) technology becomes ubiquitous and the volume of data continues to rise, HTS read alignment is becoming increasingly rate-limiting, which keeps pressing the development of novel read alignment approaches. Moreover, promising novel applications of HTS technology require aligning reads to multiple genomes instead of a single reference; however, it is still not viable for the state-of-the-art aligners to align large numbers of reads to multiple genomes.
Results: We propose de Bruijn Graph-based Aligner (deBGA), an innovative graph-based seed-and-extension algorithm to align HTS reads to a reference genome that is organized and indexed using a de Bruijn graph. With its well-handling of repeats, deBGA is substantially faster than state-of-the-art approaches while maintaining similar or higher sensitivity and accuracy. This makes it particularly well-suited to handle the rapidly growing volumes of sequencing data. Furthermore, it provides a promising solution for aligning reads to multiple genomes and graph-based references in HTS applications.
Availability and Implementation: deBGA is available at: https://github.com/hitbc/deBGA.
Contact: ydwang@hit.edu.cn
Supplementary information : Supplementary data are available at Bioinformatics online.
Metrics:
1
Canned Analyses generated by the tool
There are no indexed analyses by this tool at the moment.
Datasets analyzed by the tool
There are no indexed analyses by this tool at the moment.
FAIR Evaluation
Sorry, you must be signed in to evaluate this object.