메뉴 건너뛰기




Volumn 1, Issue 4, 2004, Pages 171-180

A polynomial-time algorithm for the matching of crossing contact-map patterns

Author keywords

Algorithm design and analysis; Biology and genetics; Pattern matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GENETIC ENGINEERING; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; PROTEINS; RNA;

EID: 14744269686     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2004.35     Document Type: Conference Paper
Times cited : (11)

References (19)
  • 1
    • 0346339702 scopus 로고    scopus 로고
    • Computing the similarity of two sequences with nested arc annotations
    • J. Alber, J. Gramm, J. Guo, and R. Niedermeier, "Computing the Similarity of Two Sequences with Nested Arc Annotations," Theoretical Computer Science, vol. 312, pp. 337-358, 2004.
    • (2004) Theoretical Computer Science , vol.312 , pp. 337-358
    • Alber, J.1    Gramm, J.2    Guo, J.3    Niedermeier, R.4
  • 12
    • 10644263690 scopus 로고    scopus 로고
    • The longest common subsequence problem for arc-annotated sequences
    • T. Jiang, G.-H. Lin, B. Ma, and K. Zhang, "The Longest Common Subsequence Problem for Arc-Annotated Sequences," J. Discrete Algorithms, vol. 2, no. 2, pp. 257-270, 2004.
    • (2004) J. Discrete Algorithms , vol.2 , Issue.2 , pp. 257-270
    • Jiang, T.1    Lin, G.-H.2    Ma, B.3    Zhang, K.4
  • 13
    • 1842451398 scopus 로고    scopus 로고
    • 1001 optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap
    • A. Caprara, R. Carr, S. Istrail, G. Lancia, and B. Walenz, "1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap," J. Computational Biology, vol. 11, no. 1, pp. 27-52, 2004.
    • (2004) J. Computational Biology , vol.11 , Issue.1 , pp. 27-52
    • Caprara, A.1    Carr, R.2    Istrail, S.3    Lancia, G.4    Walenz, B.5
  • 16
    • 0030777303 scopus 로고    scopus 로고
    • CATH - A hierarchic classification of protein domain structures
    • C.A. Orengo, A.D. Michie, S. Jones, D.T. Jones, M.B. Swindells, and J.M. Thornton, "CATH - A Hierarchic Classification of Protein Domain Structures," Structure, vol. 5, no. 8, pp. 1093-1108, 1997, http://www.biochem.ucl.ac.uk/bsm/cath/.
    • (1997) Structure , vol.5 , Issue.8 , pp. 1093-1108
    • Orengo, C.A.1    Michie, A.D.2    Jones, S.3    Jones, D.T.4    Swindells, M.B.5    Thornton, J.M.6
  • 18
    • 0033965852 scopus 로고    scopus 로고
    • ProtoMap: Automatic classification of protein sequences and hierarchy of protein families
    • G. Yona, N. Linial, and M. Linial, "ProtoMap: Automatic Classification of Protein Sequences and Hierarchy of Protein Families," Nucleic Acids Research, vol. 28, pp. 49-55, 2000.
    • (2000) Nucleic Acids Research , vol.28 , pp. 49-55
    • Yona, G.1    Linial, N.2    Linial, M.3
  • 19
    • 0346339714 scopus 로고    scopus 로고
    • On the computational complexity of 2-interval pattern matching problems
    • S. Vialette, "On the Computational Complexity of 2-Interval Pattern Matching Problems," Theoretical Computer Science, vol. 312, nos. 2-3, pp. 223-249, 2004.
    • (2004) Theoretical Computer Science , vol.312 , Issue.2-3 , pp. 223-249
    • Vialette, S.1


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