Name
Abstract | ||
|---|---|---|
Rapid evolutions in sequencing technology force read mappers into flexible adaptation to longer reads, changing error models, memory barriers and novel applications.ALFALFA achieves a high performance in accurately mapping long single-end and paired-end reads to gigabase-scale reference genomes, while remaining competitive for mapping shorter reads. Its seed-and-extend workflow is underpinned by fast retrieval of super-maximal exact matches from an enhanced sparse suffix array, with flexible parameter tuning to balance performance, memory footprint and accuracy.ALFALFA is open source and available at http://alfalfa.ugent.be . |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1186/s12859-015-0533-0 | BMC Bioinformatics |
Keywords | Field | DocType |
Long read mapping, Enhanced sparse suffix array, Super-maximal exact matches, Paired-end reads | Biological evolution,Burrows–Wheeler transform,Computer science,Genome human,Bioinformatics | Journal |
Volume | Issue | ISSN |
16 | 1 | 1471-2105 |
Citations | PageRank | References |
4 | 0.40 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michaël Vyverman | 1 | 20 | 1.87 |
| Bernard De Baets | 2 | 28 | 4.32 |
| Veerle Fack | 3 | 4 | 0.40 |
| Peter Dawyndt | 4 | 5 | 0.74 |