105 related articles for article (PubMed ID: 8374083)
1. Non-similarity combinatorial problems.
Rubinov AR; Timkovsky VG
Biosystems; 1993; 30(1-3):81-92. PubMed ID: 8374083
[TBL] [Abstract][Full Text] [Related]
2. A new graph model and algorithms for consistent superstring problems.
Na JC; Cho S; Choi S; Kim JW; Park K; Sim JS
Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130134. PubMed ID: 24751868
[TBL] [Abstract][Full Text] [Related]
3. Short superstrings and the structure of overlapping strings.
Armen C; Stein C
J Comput Biol; 1995; 2(2):307-32. PubMed ID: 7497131
[TBL] [Abstract][Full Text] [Related]
4. A combinatorial approach to the design of vaccines.
Martínez L; Milanič M; Legarreta L; Medvedev P; Malaina I; de la Fuente IM
J Math Biol; 2015 May; 70(6):1327-58. PubMed ID: 24859149
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. Chemical reaction optimization for solving shortest common supersequence problem.
Khaled Saifullah CM; Rafiqul Islam M
Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980
[TBL] [Abstract][Full Text] [Related]
8. Reconstructing strings from substrings.
Skiena SS; Sundaram G
J Comput Biol; 1995; 2(2):333-53. PubMed ID: 7497132
[TBL] [Abstract][Full Text] [Related]
9. Reconstruction of a string from substring precedence data.
Rubinov AR; Gelfand MS
J Comput Biol; 1995; 2(2):371-81. PubMed ID: 7497134
[TBL] [Abstract][Full Text] [Related]
10. Reconstruction algorithms for DNA-storage systems.
Sabary O; Yucovich A; Shapira G; Yaakobi E
Sci Rep; 2024 Jan; 14(1):1951. PubMed ID: 38263421
[TBL] [Abstract][Full Text] [Related]
11. PTPan--overcoming memory limitations in oligonucleotide string matching for primer/probe design.
Eissler T; Hodges CP; Meier H
Bioinformatics; 2011 Oct; 27(20):2797-805. PubMed ID: 21856736
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. An enhanced beam search algorithm for the Shortest Common Supersequence Problem.
Mousavi SR; Bahri F; Tabataba FS
Eng Appl Artif Intell; 2012 Apr; 25(3):457-467. PubMed ID: 32288320
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Parameterized complexity analysis in computational biology.
Bodlaender HL; Downey RG; Fellows MR; Hallett MT; Wareham HT
Comput Appl Biosci; 1995 Feb; 11(1):49-57. PubMed ID: 7796275
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Coevolving solutions to the shortest common superstring problem.
Zaritsky A; Sipper M
Biosystems; 2004; 76(1-3):209-16. PubMed ID: 15351144
[TBL] [Abstract][Full Text] [Related]
18. Using the longest run subsequence problem within homology-based scaffolding.
Schrinner S; Goel M; Wulfert M; Spohr P; Schneeberger K; Klau GW
Algorithms Mol Biol; 2021 Jun; 16(1):11. PubMed ID: 34183036
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Analysis and safety engineering of fuzzy string matching algorithms.
Pikies M; Ali J
ISA Trans; 2021 Jul; 113():1-8. PubMed ID: 33092862
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
