| 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 |
| Solving the minimal positional substring cover problem in sublinear space | 2025-12-02 | Paper |
| PANTAS DATA | 2024-09-10 | Dataset |
| Data structures for SMEM-finding in the PBWT | 2024-05-29 | Paper |
Modular decomposition of hypergraphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Computational graph pangenomics: a tutorial on data structures and their applications
Natural Computing | 2024-02-16 | Paper |
scientific article; zbMATH DE number 7651097 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Can formal languages help pangenomics to represent and analyze multiple genomes? | 2022-08-11 | Paper |
scientific article; zbMATH DE number 7559196 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Incomplete directed perfect phylogeny in linear time | 2022-03-25 | Paper |
| Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning | 2021-12-21 | Paper |
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
Theoretical Computer Science | 2021-03-09 | Paper |
Computing the multi-string BWT and LCP array in external memory
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 |
A tight lower bound for primitivity in k-structures
Automata, Languages and Programming | 2019-04-29 | Paper |
Maximum disjoint paths on edge-colored graphs: approximability and tractability
Algorithms | 2019-03-26 | Paper |
Inverse Lyndon words and inverse Lyndon factorizations of words
Advances in Applied Mathematics | 2018-10-16 | Paper |
| Divide and conquer computation of the multi-string BWT and LCP array | 2018-09-06 | Paper |
Species-Driven Persistent Phylogeny
Fundamenta Informaticae | 2018-01-19 | Paper |
An external-memory algorithm for string graph construction
Algorithmica | 2017-07-07 | Paper |
A colored graph approach to perfect phylogeny with persistent characters
Theoretical Computer Science | 2016-12-19 | Paper |
Restricted and swap common superstring: a multivariate algorithmic perspective
Algorithmica | 2015-09-02 | Paper |
On the fixed parameter tractability and approximability of the minimum error correction problem
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Existence of constants in regular splicing languages
Information and Computation | 2015-06-01 | Paper |
When and how the perfect phylogeny model explains evolution
Discrete and Topological Models in Molecular Biology | 2014-06-23 | Paper |
Covering pairs in directed acyclic graphs
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Covering pairs in directed acyclic graphs
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Complexity insights of the minimum duplication problem
Theoretical Computer Science | 2014-03-27 | Paper |
Parameterized complexity of \(k\)-anonymity: hardness and tractability
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
Restricted and swap common superstring: a parameterized view
Parameterized and Exact Computation | 2013-01-07 | Paper |
The binary perfect phylogeny with persistent characters
Theoretical Computer Science | 2012-10-11 | Paper |
Complexity insights of the minimum duplication problem
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
Theoretical Computer Science | 2012-05-30 | Paper |
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters | 2012-05-04 | Paper |
Variants of constrained longest common subsequence
Information Processing Letters | 2012-03-27 | Paper |
Picture languages generated by assembling tiles
Fundamenta Informaticae | 2011-11-22 | Paper |
Regular Splicing Languages Must Have a Constant
Developments in Language Theory | 2011-07-29 | Paper |
Anonymizing binary and small tables is hard to approximate
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
Parameterized complexity of \(k\)-anonymity: hardness and tractability
Lecture Notes in Computer Science | 2011-05-19 | 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 |
Fingerprint clustering with bounded number of missing values
Algorithmica | 2010-09-16 | Paper |
Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
Theoretical Computer Science | 2010-02-19 | Paper |
The k-Anonymity Problem Is Hard
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Picture Languages Generated by Assembling Tiles
Language and Automata Theory and Applications | 2009-04-02 | Paper |
A Decision Procedure for Reflexive Regular Splicing Languages
Developments in Language Theory | 2009-03-26 | Paper |
Exemplar Longest Common Subsequence
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
On the approximation of correlation clustering and consensus clustering
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Fingerprint Clustering with Bounded Number of Missing Values
Combinatorial Pattern Matching | 2007-09-14 | Paper |
A linear-time algorithm for the perfect phylogeny haplotype problem
Algorithmica | 2007-08-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Linear splicing and syntactic monoid
Discrete Applied Mathematics | 2006-04-28 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Reconciling a gene tree to a species tree under the duplication cost model
Theoretical Computer Science | 2005-12-29 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On the power of circular splicing
Discrete Applied Mathematics | 2005-09-28 | Paper |
Regular splicing languages and subclasses
Theoretical Computer Science | 2005-08-01 | Paper |
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science | 2005-06-01 | Paper |
The haplotyping problem: an overview of computational models and solutions
Journal of Computer Science and Technology | 2004-10-28 | 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 2040901 (Why is no real title available?) | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 2011850 (Why is no real title available?) | 2003-12-02 | 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 |
The complexity of multiple sequence alignment with SP-score that is a metric
Theoretical Computer Science | 2001-08-20 | Paper |
Nesting of prime substructures in k-ary relations
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1615275 (Why is no real title available?) | 2001-07-08 | Paper |
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
International Journal of Foundations of Computer Science | 2001-02-11 | Paper |
An Algorithm for the Modular Decomposition of Hypergraphs
Journal of Algorithms | 2000-08-21 | Paper |
Primitive 2-structures with the (n-2)-property
Theoretical Computer Science | 1994-09-25 | Paper |
| scientific article; zbMATH DE number 475418 (Why is no real title available?) | 1994-01-13 | Paper |
| scientific article; zbMATH DE number 475419 (Why is no real title available?) | 1994-01-13 | Paper |
On automata on infinite trees
Theoretical Computer Science | 1992-06-28 | Paper |
From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth
(available as arXiv preprint) | N/A | Paper |
