166 related articles for article (PubMed ID: 27138275)
1. 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]
2. 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]
3. 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]
4. 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]
5. Clustering DNA sequences using the out-of-place measure with reduced n-grams.
Huang HH; Yu C
J Theor Biol; 2016 Oct; 406():61-72. PubMed ID: 27375217
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. Sequence comparison alignment-free approach based on suffix tree and L-words frequency.
Soares I; Goios A; Amorim A
ScientificWorldJournal; 2012; 2012():450124. PubMed ID: 22997494
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. On the quality of tree-based protein classification.
Lazareva-Ulitsky B; Diemer K; Thomas PD
Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305
[TBL] [Abstract][Full Text] [Related]
11. A framework for space-efficient read clustering in metagenomic samples.
Alanko J; Cunial F; Belazzougui D; Mäkinen V
BMC Bioinformatics; 2017 Mar; 18(Suppl 3):59. PubMed ID: 28361710
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. 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]
15. 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]
16. The tree alignment problem.
Varón A; Wheeler WC
BMC Bioinformatics; 2012 Nov; 13():293. PubMed ID: 23140486
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Linear-time computation of minimal absent words using suffix array.
Barton C; Heliou A; Mouchard L; Pissis SP
BMC Bioinformatics; 2014 Dec; 15(1):388. PubMed ID: 25526884
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Encoded expansion: an efficient algorithm to discover identical string motifs.
Azmi AM; Al-Ssulami A
PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
