These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

127 related articles for article (PubMed ID: 21342588)

  • 1. 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]  

  • 2. 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]  

  • 3. 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]  

  • 4. 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]  

  • 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. 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]  

  • 7. 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]  

  • 8. Efficient Algorithms for Finding the Closest l-mers in Biological Data.
    Cai X; Mamun AA; Rajasekaran S
    IEEE/ACM Trans Comput Biol Bioinform; 2018 Jun; ():. PubMed ID: 29993557
    [TBL] [Abstract][Full Text] [Related]  

  • 9. 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]  

  • 10. 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]  

  • 11. 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]  

  • 12. 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]  

  • 13. 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]  

  • 14. 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]  

  • 15. 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]  

  • 16. 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]  

  • 17. Parallel Methods for Finding k-Mismatch Shortest Unique Substrings Using GPU.
    Schultz DW; Xu B
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):386-395. PubMed ID: 31425048
    [TBL] [Abstract][Full Text] [Related]  

  • 18. 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]  

  • 19. 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]  

  • 20. 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]  

    [Next]    [New Search]
    of 7.