Can formal languages help pangenomics to represent and analyze multiple genomes?
From MaRDI portal
Publication:2163974
DOI10.1007/978-3-031-05578-2_1MaRDI QIDQ2163974
Raffaella Rizzi, Yuri Pirola, Rocco Zaccagnino, Clelia De Felice, Paola Bonizzoni, Rosalba Zizza
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_1
68Q45: Formal languages and automata
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Suffix array and Lyndon factorization of a text
- Using minimal absent words to build phylogeny
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
- Wheeler graphs: a framework for BWT-based data structures
- A note on the Burrows-Wheeler transformation
- Inverse Lyndon words and inverse Lyndon factorizations of words
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning
- An external-memory algorithm for string graph construction
- An extension of the Burrows-Wheeler transform
- The string edit distance matching problem with moves
- Factorizing words over an ordered alphabet
- Minimal forbidden words and symbolic dynamics
- Indexing the bijective BWT
- On the size of overlapping Lempel-Ziv and Lyndon factorizations
- The “Runs” Theorem
- A new characterization of maximal repetitions by Lyndon trees
- On Burnside's Problem
- In-place bijective burrows-wheeler transforms
- Free differential calculus. IV: The quotient groups of the lower central series
- Computational graph pangenomics: a tutorial on data structures and their applications
