103 related articles for article (PubMed ID: 8374083)
21. Toward simplifying and accurately formulating fragment assembly.
Myers EW
J Comput Biol; 1995; 2(2):275-90. PubMed ID: 7497129
[TBL] [Abstract][Full Text] [Related]
22. Cache-oblivious dynamic programming for bioinformatics.
Chowdhury RA; Le HS; Ramachandran V
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):495-510. PubMed ID: 20671320
[TBL] [Abstract][Full Text] [Related]
23. Automatic ICD-10 coding algorithm using an improved longest common subsequence based on semantic similarity.
Chen Y; Lu H; Li L
PLoS One; 2017; 12(3):e0173410. PubMed ID: 28306739
[TBL] [Abstract][Full Text] [Related]
24. 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]
25. Fast and sensitive probe selection for DNA chips using jumps in matching statistics.
Rahmann S
Proc IEEE Comput Soc Bioinform Conf; 2003; 2():57-64. PubMed ID: 16452779
[TBL] [Abstract][Full Text] [Related]
26. 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]
27. Probe selection algorithms with applications in the analysis of microbial communities.
Borneman J; Chrobak M; Della Vedova G; Figueroa A; Jiang T
Bioinformatics; 2001; 17 Suppl 1():S39-48. PubMed ID: 11472991
[TBL] [Abstract][Full Text] [Related]
28. A string pattern regression algorithm and its application to pattern discovery in long introns.
Bannai H; Inenaga S; Shinohara A; Takeda M; Miyano S
Genome Inform; 2002; 13():3-11. PubMed ID: 14571369
[TBL] [Abstract][Full Text] [Related]
29. An algorithm for approximate tandem repeats.
Landau GM; Schmidt JP; Sokol D
J Comput Biol; 2001; 8(1):1-18. PubMed ID: 11339903
[TBL] [Abstract][Full Text] [Related]
30. 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]
31. Key-string algorithm--novel approach to computational analysis of repetitive sequences in human centromeric DNA.
Rosandić M; Paar V; Gluncić M; Basar I; Pavin N
Croat Med J; 2003 Aug; 44(4):386-406. PubMed ID: 12950141
[TBL] [Abstract][Full Text] [Related]
32. 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]
33. On some optimization problems in molecular biology.
Festa P
Math Biosci; 2007 Jun; 207(2):219-34. PubMed ID: 17512558
[TBL] [Abstract][Full Text] [Related]
34. Key-string segmentation algorithm and higher-order repeat 16mer (54 copies) in human alpha satellite DNA in chromosome 7.
Rosandić M; Paar V; Basar I
J Theor Biol; 2003 Mar; 221(1):29-37. PubMed ID: 12634041
[TBL] [Abstract][Full Text] [Related]
35. 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]
36. Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.
Ning K; Leong HW
BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S12. PubMed ID: 17217504
[TBL] [Abstract][Full Text] [Related]
37. Matching sequences under deletion-insertion constraints.
Sankoff D
Proc Natl Acad Sci U S A; 1972 Jan; 69(1):4-6. PubMed ID: 4500555
[TBL] [Abstract][Full Text] [Related]
38. Reconfigurable systems for sequence alignment and for general dynamic programming.
Jacobi RP; Ayala-Rincón M; Carvalho LG; Llanos CH; Hartenstein RW
Genet Mol Res; 2005 Sep; 4(3):543-52. PubMed ID: 16342039
[TBL] [Abstract][Full Text] [Related]
39. Optimal reconstruction of a sequence from its probes.
Frieze AM; Preparata FP; Upfal E
J Comput Biol; 1999; 6(3-4):361-8. PubMed ID: 10582572
[TBL] [Abstract][Full Text] [Related]
40. Computation of rank and select functions on hierarchical binary string and its application to genome mapping problems for short-read DNA sequences.
Kimura K; Suzuki Y; Sugano S; Koike A
J Comput Biol; 2009 Nov; 16(11):1601-13. PubMed ID: 19772398
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
