166 related articles for article (PubMed ID: 22641713)
1. 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]
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. Closest string with outliers.
Boucher C; Ma B
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S55. PubMed ID: 21342588
[TBL] [Abstract][Full Text] [Related]
4. Efficient sequential and parallel algorithms for finding edit distance based motifs.
Pal S; Xiao P; Rajasekaran S
BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
[TBL] [Abstract][Full Text] [Related]
5. Swiftly computing center strings.
Hufsky F; Kuchenbecker L; Jahn K; Stoye J; Böcker S
BMC Bioinformatics; 2011 Apr; 12():106. PubMed ID: 21504573
[TBL] [Abstract][Full Text] [Related]
6. A hybrid metaheuristic for closest string problem.
Mousavi SR
Int J Comput Biol Drug Des; 2011; 4(3):245-61. PubMed ID: 21778558
[TBL] [Abstract][Full Text] [Related]
7. libFLASM: a software library for fixed-length approximate string matching.
Ayad LA; Pissis SP; Retha A
BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
Tanaka S
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):361-74. PubMed ID: 26355783
[TBL] [Abstract][Full Text] [Related]
10. An efficient rank based approach for closest string and closest substring.
Dinu LP; Ionescu R
PLoS One; 2012; 7(6):e37576. PubMed ID: 22675483
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Fast motif recognition via application of statistical thresholds.
Boucher C; King J
BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S11. PubMed ID: 20122182
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Spatial codes and the hardness of string folding problems.
Nayak A; Sinclair A; Zwick U
J Comput Biol; 1999; 6(1):13-36. PubMed ID: 10223662
[TBL] [Abstract][Full Text] [Related]
15. The waiting time problem in a model hominin population.
Sanford J; Brewer W; Smith F; Baumgardner J
Theor Biol Med Model; 2015 Sep; 12():18. PubMed ID: 26376851
[TBL] [Abstract][Full Text] [Related]
16. Efficient exact motif discovery.
Marschall T; Rahmann S
Bioinformatics; 2009 Jun; 25(12):i356-64. PubMed ID: 19478010
[TBL] [Abstract][Full Text] [Related]
17. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.
Zörnig P
J Comput Biol; 2015 Aug; 22(8):729-42. PubMed ID: 25525691
[TBL] [Abstract][Full Text] [Related]
18. String correction using the Damerau-Levenshtein distance.
Zhao C; Sahni S
BMC Bioinformatics; 2019 Jun; 20(Suppl 11):277. PubMed ID: 31167641
[TBL] [Abstract][Full Text] [Related]
19. A parameterized algorithm for protein structure alignment.
Xu J; Jiao F; Berger B
J Comput Biol; 2007 Jun; 14(5):564-77. PubMed ID: 17683261
[TBL] [Abstract][Full Text] [Related]
20. Approximate Counting of Graphical Realizations.
Erdős PL; Kiss SZ; Miklós I; Soukup L
PLoS One; 2015; 10(7):e0131300. PubMed ID: 26161994
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
