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)

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

  • 2. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
    Al-Okaily A
    J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fast algorithms for approximate circular string matching.
    Barton C; Iliopoulos CS; Pissis SP
    Algorithms Mol Biol; 2014 Mar; 9(1):9. PubMed ID: 24656145
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 6. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
    Al-Okaily A; Huang CH
    J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.
    Ho T; Oh SR; Kim H
    PLoS One; 2017; 12(10):e0186251. PubMed ID: 29016700
    [TBL] [Abstract][Full Text] [Related]  

  • 8. MoTeX-II: structured MoTif eXtraction from large-scale datasets.
    Pissis SP
    BMC Bioinformatics; 2014 Jul; 15():235. PubMed ID: 25004797
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Encoded expansion: an efficient algorithm to discover identical string motifs.
    Azmi AM; Al-Ssulami A
    PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching.
    Azim MA; Iliopoulos CS; Rahman MS; Samiruzzaman M
    IEEE Trans Nanobioscience; 2016 Mar; 15(2):93-100. PubMed ID: 26992174
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
    Thankachan SV; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns.
    Meyer F; Kurtz S; Beckstette M
    BMC Bioinformatics; 2013 Jul; 14():226. PubMed ID: 23865810
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. A k-mismatch string matching for generalized edit distance using diagonal skipping method.
    Kim H
    PLoS One; 2021; 16(5):e0251047. PubMed ID: 33945564
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Two Efficient Techniques to Find Approximate Overlaps between Sequences.
    Haj Rachid M
    Biomed Res Int; 2017; 2017():2731385. PubMed ID: 28293632
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Shifted Hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping.
    Xin H; Greth J; Emmons J; Pekhimenko G; Kingsford C; Alkan C; Mutlu O
    Bioinformatics; 2015 May; 31(10):1553-60. PubMed ID: 25577434
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology.
    Gudur VY; Maheshwari S; Bhardwaj S; Acharyya A; Shafik R
    Annu Int Conf IEEE Eng Med Biol Soc; 2022 Jul; 2022():87-90. PubMed ID: 36086088
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 17.