Lambda: The local aligner for massive biological data

Bioinformatics

Volumn 30, Issue 17, 2014, Pages

  Hauswedell, Hannes ^a   Singer, Jochen ^a   Reinert, Knut ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER PROGRAM; DNA SEQUENCE; HIGH THROUGHPUT SEQUENCING; METAGENOMICS; PROCEDURES; SEQUENCE ALIGNMENT;

ALGORITHMS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; METAGENOMICS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84907028625     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu439     Document Type: Conference Paper

References (42)

1. Altschul, S. et al. (1990) Basic local alignment search tool. J.Mol. Bio., 215, 403-410.
2. Altschul, S.F. and Gish, W. (1996) Local alignment statistics. Methods Enzymol., 266, 460-480.
3. Altschul, S.F. et al. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res., 25, 3389-3402.
4. Altschul, S.F. et al. (2005) Protein database searches using compositionally adjusted substitution matrices. FEBS J., 272, 5101-5109.
5. Bacardit, J. et al. (2009) Automated alphabet reduction for protein datasets. BMC Bioinformatics, 10, 6.
6. Bazinet, A.L. and Cummings, M.P. (2012) A comparative evaluation of sequence classification programs. BMC Bioinformatics, 13, 92.
7. Camacho, C. et al. (2009) BLAST+: architecture and applications. BMC Bioinformatics, 10, 421.
8. Chao, K.M. et al. (1992) Aligning two sequences within a specified diagonal band. CABIOS, 8, 481-487.
9. Dagum, L. and Menon, R. (1998) OpenMP: An Industry-Standard API for Shared-Memory Programming. IEEE Comput. Sci. Eng., 5, 46-55.
10. Döring, A. et al. (2008) SeqAn An efficient, generic C++ library for sequence analysis. BMC Bioinformatics, 9, 11.
11. Edgar, R.C. (2010) Search and clustering orders of magnitude faster than BLAST. Bioinformatics, 26, 2460-2461.
12. Eikmeyer, F.G. et al. (2013) Detailed analysis of metagenome datasets obtained from biogas-producing microbial communities residing in biogas reactors does not indicate the presence of putative pathogenic microorganisms. Biotechnol. Biofuels, 6, 49.
13. Emde, A.K. et al. (2010) MicroRazerS: rapid alignment of small RNA reads. Bioinformatics, 26, 123-124.
14. Gerlach, W. and Stoye, J. (2011) Taxonomic classification of metagenomic shotgun sequences with CARMA3. Nucleic Acids Res., 39, e91.
15. Gotoh, O. (1981) An Improved Algorithm for Matching Biological Sequences. J. Mol. Bio., 162, 705-708.
16. Hirschberg, D.S. (1975) A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18, 341-343.
17. Huson, D.H. and Xie, C. (2013) A poor mans blastx-high-throughput metagenomic protein database search using pauda. Bioinformatics, 30, 38-39.
18. Huson, D.H. et al. (2007) MEGAN analysis of metagenomic data. Genome Res., 17, 377-386.
19. Kehr, B. et al. (2011) STELLAR: fast and exact local alignments. BMC Bioinformatics, 12 (Suppl. 9), S15.
20. Kent, W.J. (2002) BLAT-The BLAST-like alignment tool. Genome Res., 12, 656-664.
21. Koskinen, P. and Holm, L. (2012) SANS: high-throughput retrieval of protein sequences allowing 50% mismatches. Bioinformatics, 28, 438-443.
22. Krause, L. et al. (2008) Phylogenetic classification of short environmental DNA fragments. Nucleic Acids Res., 36, 2230-2239.
23. Lamendella, R. et al. (2011) Comparative fecal metagenomics unveils unique functional capacity of the swine gut. BMC Microbiol., 11, 103.
24. Langmead, B. and Salzberg, S.L. (2012) Fast gapped-read alignment with Bowtie 2. Nat. Methods, 9, 357-359.
25. Li, T. et al. (2003) Reduction of protein sequence complexity by residue grouping. Protein Eng., 16, 323-330.
26. Liu, L. et al. (2012) Comparison of next-generation sequencing systems. J. Biomed. Biotechnol., 2012, 11.
27. Mackelprang, R. et al. (2011) Metagenomic analysis of a permafrost microbial community reveals a rapid response to thaw. Nature, 480, 368-371.
28. Murphy, L.R. et al. (2000) Simplified amino acid alphabets for protein fold recognition and implications for folding. Protein Eng., 13, 149-152.
29. Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Bio., 48, 443-453.
30. Regan, L. and DeGrado, W.F. (1988) Characterization of a helical protein designed from first principles. Science, 241, 976-978.
31. Sander, C. and Schul, G. (1979) Degeneracy of the information contained in amino acid sequences: evidence from overlaid genes. J. Mol. Evol., 13, 245-252.
32. Siragusa, E. et al. (2013) Fast and accurate read mapping with approximate seeds and multiple backtracking. Nucleic Acids Res., 41, e78.
33. Smith, T. and Waterman, M. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
34. Tetu, S.G. et al. (2013) Life in the dark: metagenomic evidence that a microbial slime community is driven by inorganic nitrogen metabolism. ISME J., 7, 1227-1236.
35. Ukkonen, E. (1993) Approximate string-matching over suffix trees. In: Apostolico, A. et al. (eds) Combinatorial Pattern Matching, Vol. 684 of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg/New York, pp. 228-242.
36. Venter, J.C. et al. (2004) Environmental genome shotgun sequencing of the sargasso sea. Science, 304, 66-74.
37. Weese, D. et al. (2009) RazerS-fast read mapping with sensitivity control. Genome Res., 19, 1646-1654.
38. Weese, D. et al. (2012) RazerS 3: Faster, fully sensitive read mapping. Bioinformatics, 28, 2592-2599.
39. Wommack, K.E. et al. (2008) Metagenomics: read length matters. Appl. Environ. Microbiol., 74, 1453-1463.
40. Wootton, J.C. and Federhen, S. (1993) Statistics of Local Complexity in Amino Acid Sequences and Sequence Databases. Comput. Chem., 17, 149-163.
41. Ye, Y. et al. (2011) RAPSearch: a fast protein similarity search tool for short reads. BMC Bioinformatics, 12, 159.
42. Zhao, Y. et al. (2012) RAPSearch2: a fast and memory-efficient protein similarity search tool for next-generation sequencing data. Bioinformatics, 28, 125-126