166 related articles for article (PubMed ID: 22641713)
21. 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]
22. Solving the 3-SAT problem based on DNA computing.
Liu W; Gao L; Liu X; Wang S; Xu J
J Chem Inf Comput Sci; 2003; 43(6):1872-5. PubMed ID: 14632435
[TBL] [Abstract][Full Text] [Related]
23. Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
Bonizzoni P; Della Vedova G; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2019 Sep; 26(9):948-961. PubMed ID: 31140836
[No Abstract] [Full Text] [Related]
24. PMS6: a fast algorithm for motif discovery.
Bandyopadhyay S; Sahni S; Rajasekaran S
Int J Bioinform Res Appl; 2014; 10(4-5):369-83. PubMed ID: 24989858
[TBL] [Abstract][Full Text] [Related]
25. Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.
Cunha LFI; Protti F
J Comput Biol; 2019 Nov; 26(11):1214-1222. PubMed ID: 31120333
[No Abstract] [Full Text] [Related]
26. Controlled synthesis of target strings in a class of splicing systems.
Chen PC
Biosystems; 2005 Aug; 81(2):155-63. PubMed ID: 15885878
[TBL] [Abstract][Full Text] [Related]
27. An O(N2) algorithm for discovering optimal Boolean pattern pairs.
Bannai H; Hyyrö H; Shinohara A; Takeda M; Nakai K; Miyano S
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):159-70. PubMed ID: 17051698
[TBL] [Abstract][Full Text] [Related]
28. CLEMAPS: multiple alignment of protein structures based on conformational letters.
Liu X; Zhao YP; Zheng WM
Proteins; 2008 May; 71(2):728-36. PubMed ID: 17979193
[TBL] [Abstract][Full Text] [Related]
29. 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]
30. A fast algorithm for the optimal alignment of three strings.
Allison L
J Theor Biol; 1993 Sep; 164(2):261-9. PubMed ID: 8246519
[TBL] [Abstract][Full Text] [Related]
31. Linear space string correction algorithm using the Damerau-Levenshtein distance.
Zhao C; Sahni S
BMC Bioinformatics; 2020 Dec; 21(Suppl 1):4. PubMed ID: 33297940
[TBL] [Abstract][Full Text] [Related]
32. An example of design optimization for high evolvability: string rewriting grammar.
Suzuki H
Biosystems; 2003 May; 69(2-3):211-21. PubMed ID: 12689730
[TBL] [Abstract][Full Text] [Related]
33. The k partition-distance problem.
Chen YH
J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
[TBL] [Abstract][Full Text] [Related]
34. 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]
35. The physics of unwound and wound strings on the electric guitar applied to the pitch intervals produced by tremolo/vibrato arm systems.
Kemp JA
PLoS One; 2017; 12(9):e0184803. PubMed ID: 28934268
[TBL] [Abstract][Full Text] [Related]
36. 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]
37. Toward a robust search method for the protein-drug docking problem.
Sadjad BS; Zsoldos Z
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1120-33. PubMed ID: 20714029
[TBL] [Abstract][Full Text] [Related]
38. Fast molecular shape matching using contact maps.
Agarwal PK; Mustafa NH; Wang Y
J Comput Biol; 2007 Mar; 14(2):131-43. PubMed ID: 17456012
[TBL] [Abstract][Full Text] [Related]
39. 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]
40. Finite width model sequence comparison.
Chia N; Bundschuh R
Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Aug; 70(2 Pt 1):021906. PubMed ID: 15447514
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
