메뉴 건너뛰기




Volumn 16, Issue 9, 2000, Pages 808-814

An iterative method for faster sum-of-pairs multiple sequence alignment

Author keywords

[No Author keywords available]

Indexed keywords

CYTOCHROME C;

EID: 0033665509     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/16.9.808     Document Type: Article
Times cited : (48)

References (17)
  • 5
    • 85037799370 scopus 로고    scopus 로고
    • String Algorithms and Machine Learning Applications for Computational Biology, PhD dissertation, University of California, Berkeley, CA.
    • (1997)
    • Horton, P.1
  • 6
    • 84877316776 scopus 로고    scopus 로고
    • Aligning alignments
    • In Farach,M. (ed.), Proceedings of CPM 1998 Lecture Notes in Computer Science 1448, Springer Verlag, Berlin
    • (1998) , pp. 189-208
    • Kececioglu, J.D.1    Zhang, W.2
  • 7
    • 0006988521 scopus 로고
    • Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, Chichester.
    • (1990)
    • Lengauer, T.1
  • 8
    • 85037795890 scopus 로고    scopus 로고
    • (To appear) The practical use of the A* algorithm for exact multiple sequence alignment
    • Accepted for publication. (See also Technical Report 97-1-028, MPI furInformatik, Saarbrucken, Germany
    • (1997) J. Comp. Biol.
    • Lermen, M.1    Reinert, K.2
  • 9
    • 0006909511 scopus 로고    scopus 로고
    • LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, UK.
    • (1999)
    • Mehlhorn, K.1    Naher, S.2
  • 12
    • 0345676554 scopus 로고    scopus 로고
    • Multiple sequence alignment with the divide-and-conquer method
    • (1998) Gene , vol.211
    • Stoye, J.1
  • 13
    • 0031458591 scopus 로고    scopus 로고
    • DCA: An efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment
    • (1997) CABIOS , vol.13 , Issue.6 , pp. 625-626
    • Stoye, J.1    Moulton, V.2    Dress, A.W.M.3


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