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 *

122 related articles for article (PubMed ID: 22675483)

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

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

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

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

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

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

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

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

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

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

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

  • 14. Settling the intractability of multiple alignment.
    Elias I
    J Comput Biol; 2006 Sep; 13(7):1323-39. PubMed ID: 17037961
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. An improved string composition method for sequence comparison.
    Lu G; Zhang S; Fang X
    BMC Bioinformatics; 2008 May; 9 Suppl 6(Suppl 6):S15. PubMed ID: 18541050
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A hybrid metaheuristic for closest string problem.
    Mousavi SR
    Int J Comput Biol Drug Des; 2011; 4(3):245-61. PubMed ID: 21778558
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Vertical decomposition with Genetic Algorithm for Multiple Sequence Alignment.
    Naznin F; Sarker R; Essam D
    BMC Bioinformatics; 2011 Aug; 12():353. PubMed ID: 21867510
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.