| Publication | Date of Publication | Type |
|---|
| Unveiling the connection between the Lyndon factorization and the canonical inverse Lyndon factorization via a border property | 2026-05-12 | Paper |
| Can formal languages help pangenomics to represent and analyze multiple genomes? | 2022-08-11 | Paper |
| Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning | 2021-12-21 | Paper |
Hybrid and generalized marked systems
Theoretical Computer Science | 2021-11-11 | Paper |
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
Theoretical Computer Science | 2021-03-09 | Paper |
| Circular languages generated by complete splicing systems and pure unitary languages | 2021-01-26 | Paper |
| Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words | 2020-07-27 | Paper |
Unavoidable sets, prefix graphs and regularity of circular splicing languages
Fundamenta Informaticae | 2020-06-21 | Paper |
Inverse Lyndon words and inverse Lyndon factorizations of words
Advances in Applied Mathematics | 2018-10-16 | Paper |
Unavoidable sets and circular splicing languages
Theoretical Computer Science | 2016-12-19 | Paper |
Testing DNA code words properties of regular languages
Theoretical Computer Science | 2015-12-10 | Paper |
An easy automata based algorithm for testing coding properties of infinite sets of (DNA) words
Theory and Practice of Natural Computing | 2012-11-21 | Paper |
A characterization of (regular) circular languages generated by monotone complete splicing systems
Theoretical Computer Science | 2010-11-19 | Paper |
On the regularity of circular splicing languages: a survey and new developments
Natural Computing | 2010-09-16 | Paper |
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science | 2009-11-06 | Paper |
Marked Systems and Circular Splicing
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Linear splicing and syntactic monoid
Discrete Applied Mathematics | 2006-04-28 | Paper |
On the power of circular splicing
Discrete Applied Mathematics | 2005-09-28 | Paper |
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science | 2005-06-01 | Paper |
Circular splicing and regularity
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
Circular splicing and regularity
RAIRO - Theoretical Informatics and Applications | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2051176 (Why is no real title available?) | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 2040901 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 1948488 (Why is no real title available?) | 2003-07-13 | Paper |
Separating some splicing models.
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1738645 (Why is no real title available?) | 2002-05-07 | Paper |
From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
(available as arXiv preprint) | N/A | Paper |
