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 *

327 related articles for article (PubMed ID: 27832739)

  • 21. A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment.
    Kimura K; Koike A; Nakai K
    J Bioinform Comput Biol; 2012 Aug; 10(4):1250002. PubMed ID: 22809415
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Inapproximability of (1,2)-exemplar distance.
    Bulteau L; Jiang M
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1384-90. PubMed ID: 24407297
    [TBL] [Abstract][Full Text] [Related]  

  • 23. ALFRED: A Practical Method for Alignment-Free Distance Computation.
    Thankachan SV; Chockalingam SP; Liu Y; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):452-60. PubMed ID: 27138275
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A software system for gene sequence database construction based on fast approximate string matching.
    Liu Z; Borneman J; Jiang T
    Int J Bioinform Res Appl; 2005; 1(3):273-91. PubMed ID: 18048136
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 27. MARS: improving multiple circular sequence alignment using refined sequences.
    Ayad LA; Pissis SP
    BMC Genomics; 2017 Jan; 18(1):86. PubMed ID: 28088189
    [TBL] [Abstract][Full Text] [Related]  

  • 28. microTaboo: a general and practical solution to the k-disjoint problem.
    Al-Jaff M; Sandström E; Grabherr M
    BMC Bioinformatics; 2017 May; 18(1):228. PubMed ID: 28464826
    [TBL] [Abstract][Full Text] [Related]  

  • 29. The WM-q multiple exact string matching algorithm for DNA sequences.
    Karcioglu AA; Bulut H
    Comput Biol Med; 2021 Sep; 136():104656. PubMed ID: 34333228
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Hardware-Software Codesign Based Accelerated and Reconfigurable Methodology for String Matching in Computational Bioinformatics Applications.
    Gudur VY; Acharyya A
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(4):1198-1210. PubMed ID: 30530335
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A Fast and Simple Pattern Matching with Hamming Distance on Large Alphabets.
    Ristov S
    J Comput Biol; 2016 Nov; 23(11):874-876. PubMed ID: 27310482
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. On approximate string matching of unique oligonucleotides.
    Hyyrö H; Vihinen M; Juhola M
    Stud Health Technol Inform; 2001; 84(Pt 2):960-4. PubMed ID: 11604874
    [TBL] [Abstract][Full Text] [Related]  

  • 34. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Approximate string matching using phase correlation.
    Alba A; Rodriguez-Kessler M; Arce-Santana ER; Mendez MO
    Annu Int Conf IEEE Eng Med Biol Soc; 2012; 2012():6309-12. PubMed ID: 23367371
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

    [Previous]   [Next]    [New Search]
    of 17.