127 related articles for article (PubMed ID: 27556803)
1. 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]
2. 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]
3. Reference-based genome compression using the longest matched substrings with parallelization consideration.
Lu Z; Guo L; Chen J; Wang R
BMC Bioinformatics; 2023 Sep; 24(1):369. PubMed ID: 37777730
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. 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]
6. 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]
7. Algorithmic height compression of unordered trees.
Ben-Naoum F; Godin C
J Theor Biol; 2016 Jan; 389():237-52. PubMed ID: 26551155
[TBL] [Abstract][Full Text] [Related]
8. Multiple genome alignment based on longest path in directed acyclic graphs.
Ma F; Deogun JS
Int J Bioinform Res Appl; 2010; 6(4):366-83. PubMed ID: 20940124
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
Baier U; Beller T; Ohlebusch E
Bioinformatics; 2016 Feb; 32(4):497-504. PubMed ID: 26504144
[TBL] [Abstract][Full Text] [Related]
11. A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problems.
Yu C; Lin P; Zhao Y; Ren T; Wang G
BMC Bioinformatics; 2022 Sep; 23(1):366. PubMed ID: 36071384
[TBL] [Abstract][Full Text] [Related]
12. Suffix tree searcher: exploration of common substrings in large DNA sequence sets.
Minkley D; Whitney MJ; Lin SH; Barsky MG; Kelly C; Upton C
BMC Res Notes; 2014 Jul; 7():466. PubMed ID: 25053142
[TBL] [Abstract][Full Text] [Related]
13. Acceleration of sequence clustering using longest common subsequence filtering.
Namiki Y; Ishida T; Akiyama Y
BMC Bioinformatics; 2013; 14 Suppl 8(Suppl 8):S7. PubMed ID: 23815271
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem.
Peng Z; Wang Y
Front Genet; 2017; 8():104. PubMed ID: 28848600
[TBL] [Abstract][Full Text] [Related]
16. A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems.
Wei S; Wang Y; Yang Y; Liu S
Bioinformatics; 2020 May; 36(10):3035-3042. PubMed ID: 32119070
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. 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]
19. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
Heydari M; Miclotte G; Van de Peer Y; Fostier J
BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
[TBL] [Abstract][Full Text] [Related]
20. Modified HuffBit Compress Algorithm - An Application of R.
Habib N; Ahmed K; Jabin I; Rahman MM
J Integr Bioinform; 2018 Feb; 15(3):. PubMed ID: 29470175
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
