147 related articles for article (PubMed ID: 30958704)
1. 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]
2. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
Chen ZZ; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. 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]
5. 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]
6. Encoded expansion: an efficient algorithm to discover identical string motifs.
Azmi AM; Al-Ssulami A
PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
[TBL] [Abstract][Full Text] [Related]
7. Improved algorithms for approximate string matching (extended abstract).
Papamichail D; Papamichail G
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S10. PubMed ID: 19208109
[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. 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]
10. 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]
11. A fast parallel algorithm for finding the longest common sequence of multiple biosequences.
Chen Y; Wan A; Liu W
BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S4. PubMed ID: 17217522
[TBL] [Abstract][Full Text] [Related]
12. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
Thankachan SV; Apostolico A; Aluru S
J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840
[TBL] [Abstract][Full Text] [Related]
13. ALFRED: A Practical Method for Alignment-Free Distance Computation.
Thankachan SV; Chockalingam SP; Liu Y; Apostolico A; Aluru S
J Comput Biol; 2016 Jun; 23(6):452-60. PubMed ID: 27138275
[TBL] [Abstract][Full Text] [Related]
14. OMPPM: online multiple palindrome pattern matching.
Kim H; Han YS
Bioinformatics; 2016 Apr; 32(8):1151-7. PubMed ID: 26677963
[TBL] [Abstract][Full Text] [Related]
15. On the hardness of counting and sampling center strings.
Boucher C; Omar M
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1843-6. PubMed ID: 22641713
[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. Non-similarity combinatorial problems.
Rubinov AR; Timkovsky VG
Biosystems; 1993; 30(1-3):81-92. PubMed ID: 8374083
[TBL] [Abstract][Full Text] [Related]
18. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
Al-Okaily A; Huang CH
J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Linear-time computation of minimal absent words using suffix array.
Barton C; Heliou A; Mouchard L; Pissis SP
BMC Bioinformatics; 2014 Dec; 15(1):388. PubMed ID: 25526884
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
