126 related articles for article (PubMed ID: 28848600)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. New Construction of Family of MLCS Algorithms.
Shi H; Wang J
J Healthc Eng; 2021; 2021():6636710. PubMed ID: 33542799
[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. 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]
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. 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]
11. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
Dinh H; Rajasekaran S
Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. A DAG scheduling scheme on heterogeneous computing systems using tuple-based chemical reaction optimization.
Jiang Y; Shao Z; Guo Y
ScientificWorldJournal; 2014; 2014():404375. PubMed ID: 25143977
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. Sequence-based enzyme catalytic domain prediction using clustering and aggregated mutual information content.
Choi K; Kim S
J Bioinform Comput Biol; 2011 Oct; 9(5):597-611. PubMed ID: 21976378
[TBL] [Abstract][Full Text] [Related]
18. Sequence Alignment on Directed Graphs.
Kavya VNS; Tayal K; Srinivasan R; Sivadasan N
J Comput Biol; 2019 Jan; 26(1):53-67. PubMed ID: 30204489
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. An efficient reachability query based pruning algorithm in e-health scenario.
Mondal S; Mukherjee N
J Biomed Inform; 2019 Jun; 94():103171. PubMed ID: 31004797
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
