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 *

182 related articles for article (PubMed ID: 19208109)

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

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

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

  • 4. Linear space string correction algorithm using the Damerau-Levenshtein distance.
    Zhao C; Sahni S
    BMC Bioinformatics; 2020 Dec; 21(Suppl 1):4. PubMed ID: 33297940
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. A fast algorithm for the optimal alignment of three strings.
    Allison L
    J Theor Biol; 1993 Sep; 164(2):261-9. PubMed ID: 8246519
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
    Wang X; Wang L; Zhu D
    J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
    [No Abstract]   [Full Text] [Related]  

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

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

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

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

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

  • 15. Shortest Path Edit Distance for Enhancing UMLS Integration and Audit.
    Rudniy A; Geller J; Song M
    AMIA Annu Symp Proc; 2010 Nov; 2010():697-701. PubMed ID: 21347068
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. Efficient edit distance with duplications and contractions.
    Pinhas T; Zakov S; Tsur D; Ziv-Ukelson M
    Algorithms Mol Biol; 2013 Oct; 8(1):27. PubMed ID: 24168705
    [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. A Simple Linear Space Algorithm for Computing Nonoverlapping Inversion and Transposition Distance in Quadratic Average Time.
    Wang X; Wang L
    J Comput Biol; 2018 Jun; 25(6):563-575. PubMed ID: 29658774
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.