메뉴 건너뛰기




Volumn 7, Issue 5, 2000, Pages 655-671

The practical use of the A* algorithm for exact multiple sequence alignment

Author keywords

Dynamic programming; Multiple sequence alignment; Shortest path

Indexed keywords

ALGORITHM; ARTICLE; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; MATHEMATICS; PRIORITY JOURNAL; AMINO ACID SEQUENCE; COMPARATIVE STUDY; COMPUTER PROGRAM; FACTUAL DATABASE; METHODOLOGY; MOLECULAR GENETICS; SEQUENCE ALIGNMENT; SEQUENCE HOMOLOGY; STATISTICS;

EID: 0034352262     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652701446134     Document Type: Article
Times cited : (30)

References (18)
  • 15
    • 0031305540 scopus 로고    scopus 로고
    • New flexible approaches for multiple sequence alignment
    • Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB97)
    • (1997) , pp. 409-420
    • Shibuya, T.1    Imai, H.2
  • 16
    • 0031458591 scopus 로고    scopus 로고
    • DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment
    • in press
    • (1997) CABIOS , vol.13 , Issue.6
    • Stoye, J.1    Moulton, V.2    Dress, A.W.M.3


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