119 related articles for article (PubMed ID: 20570215)
1. 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]
2. Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.
Ning K; Leong HW
BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S12. PubMed ID: 17217504
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. CLAGen: a tool for clustering and annotating gene sequences using a suffix tree algorithm.
Han Si; Lee SG; Kim KH; Choi CJ; Kim YH; Hwang KS
Biosystems; 2006 Jun; 84(3):175-82. PubMed ID: 16384634
[TBL] [Abstract][Full Text] [Related]
5. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
He D; Arslan AN
Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
[TBL] [Abstract][Full Text] [Related]
6. An efficient similarity search based on indexing in large DNA databases.
Jeong IS; Park KW; Kang SH; Lim HS
Comput Biol Chem; 2010 Apr; 34(2):131-6. PubMed ID: 20418167
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm.
Chen W; Liao B; Zhu W; Xiang X
J Comput Chem; 2009 Oct; 30(13):2031-8. PubMed ID: 19130503
[TBL] [Abstract][Full Text] [Related]
9. Fast, optimal alignment of three sequences using linear gap costs.
Powell DR; Allison L; Dix TI
J Theor Biol; 2000 Dec; 207(3):325-36. PubMed ID: 11082303
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. 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]
12. MultiMCS: a fast algorithm for the maximum common substructure problem on multiple molecules.
Hariharan R; Janakiraman A; Nilakantan R; Singh B; Varghese S; Landrum G; Schuffenhauer A
J Chem Inf Model; 2011 Apr; 51(4):788-806. PubMed ID: 21446748
[TBL] [Abstract][Full Text] [Related]
13. A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment.
Liu S; Wang Y; Tong W; Wei S
Bioinformatics; 2020 Feb; 36(4):1066-1073. PubMed ID: 31584616
[TBL] [Abstract][Full Text] [Related]
14. Fast tandem mass spectra-based protein identification regardless of the number of spectra or potential modifications examined.
Falkner J; Andrews P
Bioinformatics; 2005 May; 21(10):2177-84. PubMed ID: 15746284
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. Murlet: a practical multiple alignment tool for structural RNA sequences.
Kiryu H; Tabei Y; Kin T; Asai K
Bioinformatics; 2007 Jul; 23(13):1588-98. PubMed ID: 17459961
[TBL] [Abstract][Full Text] [Related]
18. A FAST pattern matching algorithm.
Sheik SS; Aggarwal SK; Poddar A; Balakrishnan N; Sekar K
J Chem Inf Comput Sci; 2004; 44(4):1251-6. PubMed ID: 15272832
[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. The distribution and deposition algorithm for multiple oligo nucleotide arrays.
Ning K; Leong HW
Genome Inform; 2006; 17(2):89-99. PubMed ID: 17503382
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
