80 related articles for article (PubMed ID: 17051699)
1. A polynomial-time algorithm for the matching of crossing contact-map patterns.
Gramm J
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):171-80. PubMed ID: 17051699
[TBL] [Abstract][Full Text] [Related]
2. Divide and Conquer Approach to Contact Map Overlap Problem Using 2D-Pattern Mining of Protein Contact Networks.
Koneru SV; Bhavani DS
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(4):729-37. PubMed ID: 26357311
[TBL] [Abstract][Full Text] [Related]
3. Fast molecular shape matching using contact maps.
Agarwal PK; Mustafa NH; Wang Y
J Comput Biol; 2007 Mar; 14(2):131-43. PubMed ID: 17456012
[TBL] [Abstract][Full Text] [Related]
4. Local Exact Pattern Matching for Non-Fixed RNA Structures.
Amit M; Backofen R; Heyne S; Landau GM; Möhl M; Otto C; Will S
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):219-30. PubMed ID: 26355520
[TBL] [Abstract][Full Text] [Related]
5. Algorithms for optimal protein structure alignment.
Poleksic A
Bioinformatics; 2009 Nov; 25(21):2751-6. PubMed ID: 19734152
[TBL] [Abstract][Full Text] [Related]
6. Mining minimal motif pair sets maximally covering interactions in a protein-protein interaction network.
Boyen P; Neven F; van Dyck D; Valentim FL; van Dijk AD
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):73-86. PubMed ID: 23702545
[TBL] [Abstract][Full Text] [Related]
7. A similarity matrix-based hybrid algorithm for the contact map overlaps problem.
Lu H; Yang G; Yeung LF
Comput Biol Med; 2011 May; 41(5):247-52. PubMed ID: 21439563
[TBL] [Abstract][Full Text] [Related]
8. Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application.
Liu X; Li J; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):354-64. PubMed ID: 20431154
[TBL] [Abstract][Full Text] [Related]
9. A parameterized algorithm for protein structure alignment.
Xu J; Jiao F; Berger B
J Comput Biol; 2007 Jun; 14(5):564-77. PubMed ID: 17683261
[TBL] [Abstract][Full Text] [Related]
10. Improved algorithms for matching r-separated sets with applications to protein structure alignment.
Poleksic A
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):226-9. PubMed ID: 23702560
[TBL] [Abstract][Full Text] [Related]
11. Recovery of protein structure from contact maps.
Vendruscolo M; Kussell E; Domany E
Fold Des; 1997; 2(5):295-306. PubMed ID: 9377713
[TBL] [Abstract][Full Text] [Related]
12. An O(N2) algorithm for discovering optimal Boolean pattern pairs.
Bannai H; Hyyrö H; Shinohara A; Takeda M; Nakai K; Miyano S
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):159-70. PubMed ID: 17051698
[TBL] [Abstract][Full Text] [Related]
13. Structured motifs search.
Morgante M; Policriti A; Vitacolonna N; Zuccolo A
J Comput Biol; 2005 Oct; 12(8):1065-82. PubMed ID: 16241898
[TBL] [Abstract][Full Text] [Related]
14. Constructing level-2 phylogenetic networks from triplets.
van Iersel L; Keijsper J; Kelk S; Stougie L; Hagen F; Boekhout T
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):667-81. PubMed ID: 19875864
[TBL] [Abstract][Full Text] [Related]
15. Reconstruction of 3D structures from protein contact maps.
Vassura M; Margara L; Di Lena P; Medri F; Fariselli P; Casadio R
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(3):357-67. PubMed ID: 18670040
[TBL] [Abstract][Full Text] [Related]
16. The protein threading problem with sequence amino acid interaction preferences is NP-complete.
Lathrop RH
Protein Eng; 1994 Sep; 7(9):1059-68. PubMed ID: 7831276
[TBL] [Abstract][Full Text] [Related]
17. Approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots.
Jiang M
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):323-32. PubMed ID: 20431151
[TBL] [Abstract][Full Text] [Related]
18. On the approximation of optimal structures for RNA-RNA interaction.
Mneimneh S
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):682-8. PubMed ID: 19875865
[TBL] [Abstract][Full Text] [Related]
19. Identifying structural motifs in proteins.
Singh R; Saha M
Pac Symp Biocomput; 2003; ():228-39. PubMed ID: 12603031
[TBL] [Abstract][Full Text] [Related]
20. Parameterized algorithmics for finding connected motifs in biological networks.
Betzler N; van Bevern R; Fellows MR; Komusiewicz C; Niedermeier R
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1296-308. PubMed ID: 21282862
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
