144 related articles for article (PubMed ID: 17975265)
1. Exemplar longest common subsequence.
Bonizzoni P; Della Vedova G; Dondi R; Fertin G; Rizzi R; Vialette S
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):535-43. PubMed ID: 17975265
[TBL] [Abstract][Full Text] [Related]
2. The zero exemplar distance problem.
Jiang M
J Comput Biol; 2011 Sep; 18(9):1077-86. PubMed ID: 21899417
[TBL] [Abstract][Full Text] [Related]
3. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
Wang X; Wang L; Zhu D
J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
[No Abstract] [Full Text] [Related]
4. An OpenMP-based tool for finding longest common subsequence in bioinformatics.
Shikder R; Thulasiraman P; Irani P; Hu P
BMC Res Notes; 2019 Apr; 12(1):220. PubMed ID: 30971295
[TBL] [Abstract][Full Text] [Related]
5. Finite width model sequence comparison.
Chia N; Bundschuh R
Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Aug; 70(2 Pt 1):021906. PubMed ID: 15447514
[TBL] [Abstract][Full Text] [Related]
6. Algorithms for the Uniqueness of the Longest Common Subsequence.
Wang Y
J Bioinform Comput Biol; 2023 Dec; 21(6):2350027. PubMed ID: 38212873
[TBL] [Abstract][Full Text] [Related]
7. Deposition and extension approach to find longest common subsequence for thousands of long sequences.
Ning K
Comput Biol Chem; 2010 Jun; 34(3):149-57. PubMed ID: 20570215
[TBL] [Abstract][Full Text] [Related]
8. A hyper-heuristic for the Longest Common Subsequence problem.
Tabataba FS; Mousavi SR
Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
[TBL] [Abstract][Full Text] [Related]
9. A new algorithm for "the LCS problem" with application in compressing genome resequencing data.
Beal R; Afrin T; Farheen A; Adjeroh D
BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):544. PubMed ID: 27556803
[TBL] [Abstract][Full Text] [Related]
10. [Extraction of symbolic determinants common to a family of biological sequences].
Saurin W; Marlière P
Biochimie; 1985 May; 67(5):517-21. PubMed ID: 2411300
[TBL] [Abstract][Full Text] [Related]
11. Fast model-based protein homology detection without alignment.
Hochreiter S; Heusel M; Obermayer K
Bioinformatics; 2007 Jul; 23(14):1728-36. PubMed ID: 17488755
[TBL] [Abstract][Full Text] [Related]
12. Reconstruction of ancestral genomic sequences using likelihood.
Elias I; Tuller T
J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
[TBL] [Abstract][Full Text] [Related]
13. An exact algorithm for the zero exemplar breakpoint distance problem.
Zhu D; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1469-77. PubMed ID: 24407305
[TBL] [Abstract][Full Text] [Related]
14. Discriminative motifs.
Sinha S
J Comput Biol; 2003; 10(3-4):599-615. PubMed ID: 12935347
[TBL] [Abstract][Full Text] [Related]
15. Fixed-parameter tractability of the maximum agreement supertree problem.
Guillemot S; Berry V
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
[TBL] [Abstract][Full Text] [Related]
16. Parameterized complexity analysis in computational biology.
Bodlaender HL; Downey RG; Fellows MR; Hallett MT; Wareham HT
Comput Appl Biosci; 1995 Feb; 11(1):49-57. PubMed ID: 7796275
[TBL] [Abstract][Full Text] [Related]
17. Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
Sridhar S; Dhamdhere K; Blelloch G; Halperin E; Ravi R; Schwartz R
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):561-71. PubMed ID: 17975268
[TBL] [Abstract][Full Text] [Related]
18. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
Guillemot S; Jansson J; Sung WK
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
[TBL] [Abstract][Full Text] [Related]
19. A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
Yang J; Xu Y; Shang Y; Chen G
IEEE Trans Knowl Data Eng; 2014 Nov; 26(11):2599-2609. PubMed ID: 25400485
[TBL] [Abstract][Full Text] [Related]
20. Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic.
Abdi A; Hajsaeedi M; Hooshmand M
Comput Biol Chem; 2023 Aug; 105():107882. PubMed ID: 37244077
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
