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 *

180 related articles for article (PubMed ID: 27058840)

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

  • 2. ALFRED: A Practical Method for Alignment-Free Distance Computation.
    Thankachan SV; Chockalingam SP; Liu Y; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):452-60. PubMed ID: 27138275
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An alignment-free heuristic for fast sequence comparisons with applications to phylogeny reconstruction.
    Chockalingam SP; Pannu J; Hooshmand S; Thankachan SV; Aluru S
    BMC Bioinformatics; 2020 Nov; 21(Suppl 6):404. PubMed ID: 33203364
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A greedy alignment-free distance estimator for phylogenetic inference.
    Thankachan SV; Chockalingam SP; Liu Y; Krishnan A; Aluru S
    BMC Bioinformatics; 2017 Jun; 18(Suppl 8):238. PubMed ID: 28617225
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison.
    Leimeister CA; Morgenstern B
    Bioinformatics; 2014 Jul; 30(14):2000-8. PubMed ID: 24828656
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.
    Allen DR; Thankachan SV; Xu B
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):138-148. PubMed ID: 31985439
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 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. An efficient algorithm for statistical multiple alignment on arbitrary phylogenetic trees.
    Lunter GA; Miklós I; Song YS; Hein J
    J Comput Biol; 2003; 10(6):869-89. PubMed ID: 14980015
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. The average common substring approach to phylogenomic reconstruction.
    Ulitsky I; Burstein D; Tuller T; Chor B
    J Comput Biol; 2006 Mar; 13(2):336-50. PubMed ID: 16597244
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient enumeration of phylogenetically informative substrings.
    Angelov S; Harb B; Kannan S; Khanna S; Kim J
    J Comput Biol; 2007; 14(6):701-23. PubMed ID: 17691889
    [TBL] [Abstract][Full Text] [Related]  

  • 14. MissMax: alignment-free sequence comparison with mismatches through filtering and heuristics.
    Pizzi C
    Algorithms Mol Biol; 2016; 11():6. PubMed ID: 27103940
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Multiple Sequence Alignment Based on a Suffix Tree and Center-Star Strategy: A Linear Method for Multiple Nucleotide Sequence Alignment on Spark Parallel Framework.
    Su W; Liao X; Lu Y; Zou Q; Peng S
    J Comput Biol; 2017 Dec; 24(12):1230-1242. PubMed ID: 29116822
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Regular language constrained sequence alignment revisited.
    Kucherov G; Pinhas T; Ziv-Ukelson M
    J Comput Biol; 2011 May; 18(5):771-81. PubMed ID: 21554020
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Bayesian coestimation of phylogeny and sequence alignment.
    Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
    BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 9.