KFinger: Capturing Overlaps Between Long Reads by Using Lyndon Fingerprints

[1]  Paola Bonizzoni,et al.  On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties , 2020, Theor. Comput. Sci..

[2]  Paola Bonizzoni,et al.  Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words , 2019, LATA.

[3]  Luiz Irber,et al.  Large-scale sequence comparisons with sourmash , 2019, bioRxiv.

[4]  Renmin Han,et al.  DeepSimulator: a deep simulator for Nanopore sequencing , 2017, bioRxiv.

[5]  Heng Li,et al.  Minimap2: pairwise alignment for nucleotide sequences , 2017, Bioinform..

[6]  P. Bonizzoni,et al.  Inverse Lyndon words and Inverse Lyndon factorizations of words , 2017, Adv. Appl. Math..

[7]  S. Koren,et al.  Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation , 2016, bioRxiv.

[8]  Srinivas Aluru,et al.  A Fast Approximate Algorithm for Mapping Long Reads to Large Reference Databases , 2017, bioRxiv.

[9]  Matteo Comin,et al.  MetaProb: accurate metagenomic reads binning based on probabilistic sequence signatures , 2016, Bioinform..

[10]  N. Loman,et al.  A complete bacterial genome assembled de novo using only nanopore sequencing data , 2015, Nature Methods.

[11]  J. Landolin,et al.  Assembling large genomes with single-molecule sequencing and locality-sensitive hashing , 2014, Nature Biotechnology.

[12]  Antonio Restivo,et al.  An extension of the Burrows-Wheeler Transform , 2007, Theor. Comput. Sci..

[13]  Dominique Perrin,et al.  The origins of combinatorics on words , 2007, Eur. J. Comb..

[14]  Eric Rivals,et al.  STAR: an algorithm to Search for Tandem Approximate Repeats , 2004, Bioinform..

[15]  P. Pevzner,et al.  An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Andrei Z. Broder,et al.  On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[17]  R. Lyndon,et al.  Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series , 1958 .

[18]  R. Lyndon.  On Burnside’s problem , 1954 .

[19]  Paola Bonizzoni,et al.  Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning , 2021, AlCoB.