메뉴 건너뛰기




Volumn 37, Issue 8, 2009, Pages 1746-1750

An algorithm for DNA multiple sequence alignment based on center star method and keyword tree

Author keywords

Aho Corasick algorithm; Bioinformatics; Center star method; Keyword tree; Multiple sequence alignment

Indexed keywords

AHO-CORASICK ALGORITHM; CENTER STAR METHOD; EVOLUTIONARY TREE; IMPROVED METHODS; KEYWORD TREE; LARGE DATA; MULTIPLE SEQUENCE ALIGNMENT; MULTIPLE SEQUENCE ALIGNMENTS; SUB-STRINGS; TIME COMPLEXITY; TREE-BASED ALGORITHMS;

EID: 70249148008     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (10)

References (10)
  • 1
    • 0028679709 scopus 로고
    • On the complexity of multiple sequence alignment
    • L Wang, T Jiang. On the complexity of multiple sequence alignment [J]. Journal of Computational Biology, 1994, 1 (4): 337-34.
    • (1994) Journal of Computational Biology , vol.1 , Issue.4 , pp. 337-340
    • Wang, L.1    Jiang, T.2
  • 3
    • 0029872694 scopus 로고    scopus 로고
    • SAGA: Sequence alignment by genetic algorithm
    • Notredame C, Higgins D. G. SAGA: Sequence alignment by genetic algorithm [J]. Nucleic Acids Research. 1996, 24 (8): 1515-1524.
    • (1996) Nucleic Acids Research , vol.24 , Issue.8 , pp. 1515-1524
    • Notredame, C.1    Higgins, D.G.2
  • 4
    • 17244379179 scopus 로고    scopus 로고
    • The many faces of sequence alignment
    • Serafim Batzoglou. The many faces of sequence alignment [J]. Briefings in Bioinformatics. 2005, 6 (1): 6-22.
    • (2005) Briefings in Bioinformatics , vol.6 , Issue.1 , pp. 6-22
    • Batzoglou, S.1
  • 5
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • Aho A V, Corasick M J. Efficient string matching: An aid to bibliographic search [J]. Communications of ACM, 1975, 18 (6): 333-340.
    • (1975) Communications of ACM , vol.18 , Issue.6 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2
  • 8
    • 0027351056 scopus 로고
    • Efficient methods for multiple sequence alignment with guaranteed error bounds
    • D Gusfield. Efficient methods for multiple sequence alignment with guaranteed error bounds [J]. Bulletin of Mathematical Biology. 1993, 55 (1): 141-154.
    • (1993) Bulletin of Mathematical Biology , vol.55 , Issue.1 , pp. 141-154
    • Gusfield, D.1
  • 9
    • 0344298926 scopus 로고    scopus 로고
    • The Ribonuclease P database
    • Brown J W. The Ribonuclease P database [J]. Nucleic Acids Research, 1999, 27 (1): 314.
    • (1999) Nucleic Acids Research , vol.27 , Issue.1 , pp. 314
    • Brown, J.W.1
  • 10
    • 0034044313 scopus 로고    scopus 로고
    • Estimating the rate of molecular evolution: Incorporating noncontemporaneous sequences into maximum likelihood phylogenies
    • A Rambaut. Estimating the rate of molecular evolution: Incorporating noncontemporaneous sequences into maximum likelihood phylogenies [J]. Bioinformatics, 2000, 16 (4): 395-399.
    • (2000) Bioinformatics , vol.16 , Issue.4 , pp. 395-399
    • Rambaut, A.1


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