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 *

59 related articles for article (PubMed ID: 19229087)

  • 1. An edit-distance model for the approximate matching of timed strings.
    Dobrisek S; Zibert J; Pavesić N; Mihelic F
    IEEE Trans Pattern Anal Mach Intell; 2009 Apr; 31(4):736-41. PubMed ID: 19229087
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 5. Recognition of noisy subsequences using constrained edit distances.
    Oommen BJ
    IEEE Trans Pattern Anal Mach Intell; 1987 May; 9(5):676-85. PubMed ID: 21869426
    [TBL] [Abstract][Full Text] [Related]  

  • 6. MACFP: Maximal Approximate Consecutive Frequent Pattern Mining under Edit Distance.
    Shang J; Peng J; Han J
    Proc SIAM Int Conf Data Min; 2016 May; 2016():558-566. PubMed ID: 28174677
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Attributed string matching with merging for shape recognition.
    Tsai WH; Yu SS
    IEEE Trans Pattern Anal Mach Intell; 1985 Apr; 7(4):453-62. PubMed ID: 21869283
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Retrospective detection of potential medication errors involving drugs with similar names.
    Phatak HM; Cady PS; Heyneman CA; Culbertson VL
    J Am Pharm Assoc (2003); 2005; 45(5):616-21; quiz 622-4. PubMed ID: 16295648
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Effective decoders for DNA codes.
    Houghten S; Banik S
    Biosystems; 2022 Jan; 211():104583. PubMed ID: 34863885
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Algorithms for Colinear Chaining with Overlaps and Gap Costs.
    Jain C; Gibney D; Thankachan SV
    J Comput Biol; 2022 Nov; 29(11):1237-1251. PubMed ID: 36351202
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Novel kernels for error-tolerant graph classification.
    Neuhaus M; Riesen K; Bunke H
    Spat Vis; 2009; 22(5):425-41. PubMed ID: 19814905
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient and Precise Secure Generalized Edit Distance and Beyond.
    Zhu R; Huang Y
    IEEE Trans Dependable Secure Comput; 2022; 19(1):579-590. PubMed ID: 37020740
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Soft Bigram distance for names matching.
    Hadwan M; Al-Hagery MA; Al-Sanabani M; Al-Hagree S
    PeerJ Comput Sci; 2021; 7():e465. PubMed ID: 33981836
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Edit distance for marked point processes revisited: An implementation by binary integer programming.
    Hirata Y; Aihara K
    Chaos; 2015 Dec; 25(12):123117. PubMed ID: 26723156
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Interpreting Sequence-Levenshtein distance for determining error type and frequency between two embedded sequences of equal length.
    Logan R; Wehe AW; Woods DC; Tilly J; Khrapko K
    ArXiv; 2023 Oct; ():. PubMed ID: 37904736
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Serial position effects in the identification of letters, digits, and symbols.
    Tydgat I; Grainger J
    J Exp Psychol Hum Percept Perform; 2009 Apr; 35(2):480-98. PubMed ID: 19331502
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Two efficient calculations of edit distance between marked point processes.
    Hirata Y; Sukegawa N
    Chaos; 2019 Oct; 29(10):101107. PubMed ID: 31675806
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fast computation of a string duplication history under no-breakpoint-reuse.
    Brejová B; Kravec M; Landau GM; Vinař T
    Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130133. PubMed ID: 24751867
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Domestic cats (Felis catus) do not show causal understanding in a string-pulling task.
    Whitt E; Douglas M; Osthaus B; Hocking I
    Anim Cogn; 2009 Sep; 12(5):739-43. PubMed ID: 19449193
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 3.