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 *

134 related articles for article (PubMed ID: 33945564)

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

  • 2. Graph edit distance from spectral seriation.
    Robles-Kelly A; Hancock ER
    IEEE Trans Pattern Anal Mach Intell; 2005 Mar; 27(3):365-378. PubMed ID: 15747792
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Discriminative application of string similarity methods to chemical and non-chemical names for biomedical abbreviation clustering.
    Yamaguchi A; Yamamoto Y; Kim JD; Takagi T; Yonezawa A
    BMC Genomics; 2012 Jun; 13 Suppl 3(Suppl 3):S8. PubMed ID: 22759617
    [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. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Markov edit distance.
    Wei J
    IEEE Trans Pattern Anal Mach Intell; 2004 Mar; 26(3):311-21. PubMed ID: 15376879
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A normalized Levenshtein distance metric.
    Yujian L; Bo L
    IEEE Trans Pattern Anal Mach Intell; 2007 Jun; 29(6):1091-5. PubMed ID: 17431306
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A binary linear programming formulation of the graph edit distance.
    Justice D; Hero A
    IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 12. Time warp edit distance with stiffness adjustment for time series matching.
    Marteau PF
    IEEE Trans Pattern Anal Mach Intell; 2009 Feb; 31(2):306-18. PubMed ID: 19110495
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Self-organizing maps for learning the edit costs in graph matching.
    Neuhaus M; Bunke H
    IEEE Trans Syst Man Cybern B Cybern; 2005 Jun; 35(3):503-14. PubMed ID: 15971918
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Detecting duplicate biological entities using Shortest Path Edit Distance.
    Rudniy A; Song M; Geller J
    Int J Data Min Bioinform; 2010; 4(4):395-410. PubMed ID: 20815139
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. On optimizing syntactic pattern recognition using tries and AI-based heuristic-search strategies.
    Badr G; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2006 Jun; 36(3):611-22. PubMed ID: 16761814
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. Polynomial-time metrics for attributed trees.
    Torsello A; Hidović-Rowe D; Pelillo M
    IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1087-99. PubMed ID: 16013756
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.