메뉴 건너뛰기




Volumn 9, Issue , 2008, Pages

SeqAn an efficient, generic C++ library for sequence analysis

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC TECHNIQUES; ASSEMBLY ALGORITHM; BIOINFORMATICS TOOLS; COMPUTATIONAL BIOLOGY; EXPERIMENTAL PLATFORM; SEQUENCE ANALYSIS; STRING MATCHING ALGORITHM; TECHNOLOGICAL PROGRESS;

EID: 39549090389     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-9-11     Document Type: Article
Times cited : (241)

References (43)
  • 1
    • 0035895505 scopus 로고    scopus 로고
    • The Sequence of the Human Genome
    • Venter JC Reinert K The Sequence of the Human Genome Science 2001, 291:1145-1434.
    • (2001) Science , vol.291 , pp. 1145-1434
    • Venter, J.C.1    Reinert, K.2
  • 2
    • 0000541351 scopus 로고    scopus 로고
    • A fast bit-vector algorithm for approximate string matching based on dynamic programming
    • Myers EW A fast bit-vector algorithm for approximate string matching based on dynamic programming Journal of the ACM 1999, 46(3):395-415.
    • (1999) Journal of the ACM , vol.46 , Issue.3 , pp. 395-415
    • Myers, E.W.1
  • 6
    • 0037204994 scopus 로고    scopus 로고
    • A Comparison of Whole-Genome Shotgun-Derived Mouse Chromosome 16 and the Human Genome
    • 12040188
    • Mural RJ Adams MD Myers GW Reinert K A Comparison of Whole-Genome Shotgun-Derived Mouse Chromosome 16 and the Human Genome Science 2002, 296:1661-1671. 12040188
    • (2002) Science , vol.296 , pp. 1661-1671
    • Mural, R.J.1    Adams, M.D.2    Myers, G.W.3    Reinert, K.4
  • 10
    • 3543051830 scopus 로고    scopus 로고
    • Mauve: Multiple Alignment of Conserved Genomic Sequence with Rearrangements
    • 442156 15231754
    • Darling A Mau B Blattner F Perna N Mauve: Multiple Alignment of Conserved Genomic Sequence with Rearrangements Genome Research 2004, 14:1394-1403. 442156 15231754
    • (2004) Genome Research , vol.14 , pp. 1394-1403
    • Darling, A.1    Mau, B.2    Blattner, F.3    Perna, N.4
  • 14
    • 33745955637 scopus 로고    scopus 로고
    • Bio++: A set of C++ libraries for sequence analysis, phylogenetics, molecular evolution and population genetics
    • 1501049 16594991
    • Dutheil J Gaillard S Bazin E Glemin S Ranwez V Galtier N Belkhir K Bio++: A set of C++ libraries for sequence analysis, phylogenetics, molecular evolution and population genetics BMC Bioinformatics 2006, 7:188. 1501049 16594991
    • (2006) BMC Bioinformatics , vol.7 , pp. 188
    • Dutheil, J.1    Gaillard, S.2    Bazin, E.3    Glemin, S.4    Ranwez, V.5    Galtier, N.6    Belkhir, K.7
  • 15
    • 25444497721 scopus 로고    scopus 로고
    • libcov: A C++ bioinformatic library to manipulate protein structures, sequence alignments and phylogeny
    • 1175080 15938750
    • Butt D Roger AJ Blouin C libcov: A C++ bioinformatic library to manipulate protein structures, sequence alignments and phylogeny BMC Bioinformatics 2005, 6:138. 1175080 15938750
    • (2005) BMC Bioinformatics , vol.6 , pp. 138
    • Butt, D.1    Roger, A.J.2    Blouin, C.3
  • 17
    • 84874660408 scopus 로고    scopus 로고
    • [Internet] National Library of Medicine, National Center for Biotechnology Information, Bethesda (MD)
    • Vakatov D Siyan K Ostell J editors The NCBI C++ Toolkit [Internet] National Library of Medicine, National Center for Biotechnology Information, Bethesda (MD) 2003 http://www.ncbi.nlm.nih.gov/books/ bv.fcgi?rid=toolkit
    • (2003) The NCBI C++ Toolkit
    • Vakatov, D.1    Siyan, K.2    Ostell, J.3
  • 18
    • 0030013908 scopus 로고    scopus 로고
    • Object-oriented sequence analysis: SCL-a C++ class library
    • Vahrson W Hermann K Kleffe J Wittig B Object-oriented sequence analysis: SCL-a C++ class library Bioinformatics 1996, 12(2):119-127.
    • (1996) Bioinformatics , vol.12 , Issue.2 , pp. 119-127
    • Vahrson, W.1    Hermann, K.2    Kleffe, J.3    Wittig, B.4
  • 19
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • Needleman SB Wunsch CD A general method applicable to the search for similarities in the amino acid sequence of two proteins J Molecular Biol 1970, 48:443-453.
    • (1970) J Molecular Biol , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 21
    • 0011096627 scopus 로고    scopus 로고
    • BioJava: Open Source Components for Bioinformatics
    • Pocock M Down T Hubbard T BioJava: Open Source Components for Bioinformatics ACM SIGBIO Newsletter 2000, 20(2):10-12.
    • (2000) ACM SIGBIO Newsletter , vol.20 , Issue.2 , pp. 10-12
    • Pocock, M.1    Down, T.2    Hubbard, T.3
  • 26
    • 0020484488 scopus 로고
    • An improved algorithm for matching biological sequences
    • 7166760
    • Gotoh O An improved algorithm for matching biological sequences J Mol Biol 1982, 162(3):705-708. 7166760
    • (1982) J Mol Biol , vol.162 , Issue.3 , pp. 705-708
    • Gotoh, O.1
  • 33
    • 14944363170 scopus 로고    scopus 로고
    • PatternHunter II: Highly sensitive and fast homology search
    • 15706531
    • Li M Ma B Kisman D Tromp J PatternHunter II: Highly sensitive and fast homology search Genome Informatics 2003, 14:164-175. 15706531
    • (2003) Genome Informatics , vol.14 , pp. 164-175
    • Li, M.1    Ma, B.2    Kisman, D.3    Tromp, J.4
  • 35
    • 0023375195 scopus 로고
    • The Neighbor-Joining method: A new method, for reconstructing phylogenetic trees
    • 3447015
    • Saitou N Nei M The Neighbor-Joining method: A new method, for reconstructing phylogenetic trees Mol Biol Evol 1987, 4:406-425. 3447015
    • (1987) Mol Biol Evol , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 38
    • 0034623005 scopus 로고    scopus 로고
    • T-Coffee: A Novel Method for Fast and Accurate Multiple Sequence Alignment
    • 10964570
    • Notredame C Higgins D Heringa J T-Coffee: A Novel Method for Fast and Accurate Multiple Sequence Alignment Journal of Molecular Biology 2000, 302:205-217. 10964570
    • (2000) Journal of Molecular Biology , vol.302 , pp. 205-217
    • Notredame, C.1    Higgins, D.2    Heringa, J.3
  • 40
    • 0016518550 scopus 로고
    • A linear space algorithm for computing maximal common subsequences
    • Hirschberg DS A linear space algorithm for computing maximal common subsequences ACM Press 1975, 18(6):341-343. 341-343.
    • (1975) , vol.18 , Issue.6 , pp. 341-343
    • Hirschberg, D.S.1
  • 43
    • 3242889975 scopus 로고    scopus 로고
    • Replacing Suffix Trees with Enhanced Suffix Arrays
    • Abouelhoda M Kurtz S Ohlebusch E Replacing Suffix Trees with Enhanced Suffix Arrays Journal of Discrete Algorithms 2004, 2:53-86. http://www.zbh.uni-hamburg.de/staff/kurtz/papers/AboKurOhl2004.pdf
    • (2004) Journal of Discrete Algorithms , vol.2 , pp. 53-86
    • Abouelhoda, M.1    Kurtz, S.2    Ohlebusch, E.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.