148 related articles for article (PubMed ID: 31584616)
1. 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]
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 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]
4. 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]
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. 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]
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. Shouji: a fast and efficient pre-alignment filter for sequence alignment.
Alser M; Hassan H; Kumar A; Mutlu O; Alkan C
Bioinformatics; 2019 Nov; 35(21):4255-4263. PubMed ID: 30923804
[TBL] [Abstract][Full Text] [Related]
11. Fast gap-affine pairwise alignment using the wavefront algorithm.
Marco-Sola S; Moure JC; Moreto M; Espinosa A
Bioinformatics; 2021 May; 37(4):456-463. PubMed ID: 32915952
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. Bit-parallel sequence-to-graph alignment.
Rautiainen M; Mäkinen V; Marschall T
Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
[TBL] [Abstract][Full Text] [Related]
15. WMSA: a novel method for multiple sequence alignment of DNA sequences.
Wei Y; Zou Q; Tang F; Yu L
Bioinformatics; 2022 Nov; 38(22):5019-5025. PubMed ID: 36179076
[TBL] [Abstract][Full Text] [Related]
16. KCMBT: a k-mer Counter based on Multiple Burst Trees.
Mamun AA; Pal S; Rajasekaran S
Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950
[TBL] [Abstract][Full Text] [Related]
17. Using Multiple Fickett Bands to Accelerate Biological Sequence Comparisons.
Silva GHG; Sandes EFO; Teodoro G; Melo ACMA
J Comput Biol; 2019 Sep; 26(9):908-922. PubMed ID: 30951368
[No Abstract] [Full Text] [Related]
18. Optimal gap-affine alignment in O(s) space.
Marco-Sola S; Eizenga JM; Guarracino A; Paten B; Garrison E; Moreto M
Bioinformatics; 2023 Feb; 39(2):. PubMed ID: 36749013
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. 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]
[Next] [New Search]
