Read Mapping Algorithms for Single Molecule Sequencing Data
- 17 September 2008
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Single-Molecule DNA Sequencing of a Viral GenomeScience, 2008
- Striped Smith–Waterman speeds database searches six times over other SIMD implementationsBioinformatics, 2006
- Efficient q-Gram Filters for Finding All ε-Matches over a Given LengthJournal of Computational Biology, 2006
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- Multiple sequence alignment with the Clustal series of programsNucleic Acids Research, 2003
- Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutionsDiscrete Applied Mathematics, 2003
- Six-fold speed-up of Smith–Waterman sequence database searches using parallel processing on common microprocessorsBioinformatics, 2000
- On Near-Optimal Alignments of Biological SequencesJournal of Computational Biology, 1994
- High-Speed DNA Sequencing: An Approach Based Upon Fluorescence Detection of Single MoleculesJournal of Biomolecular Structure and Dynamics, 1989
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970