| Publication | Date of Publication | Type |
|---|
| Modular decomposition of hypergraphs | 2024-02-28 | Paper |
| Computational graph pangenomics: a tutorial on data structures and their applications | 2024-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874431 | 2023-02-07 | Paper |
| Can formal languages help pangenomics to represent and analyze multiple genomes? | 2022-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088919 | 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 | 2021-03-09 | Paper |
| Computing the multi-string BWT and LCP array in external memory | 2021-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146649 | 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 | 2020-06-21 | Paper |
| A tight lower bound for primitivity in k-structures | 2019-04-29 | Paper |
| Maximum disjoint paths on edge-colored graphs: approximability and tractability | 2019-03-26 | Paper |
| Inverse Lyndon words and inverse Lyndon factorizations of words | 2018-10-16 | Paper |
| Divide and conquer computation of the multi-string BWT and LCP array | 2018-09-06 | Paper |
| Species-Driven Persistent Phylogeny | 2018-01-19 | Paper |
| An external-memory algorithm for string graph construction | 2017-07-07 | Paper |
| A colored graph approach to perfect phylogeny with persistent characters | 2016-12-19 | Paper |
| Restricted and swap common superstring: a multivariate algorithmic perspective | 2015-09-02 | Paper |
| On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem | 2015-08-20 | Paper |
| Existence of constants in regular splicing languages | 2015-06-01 | Paper |
| When and How the Perfect Phylogeny Model Explains Evolution | 2014-06-23 | Paper |
| Covering Pairs in Directed Acyclic Graphs | 2014-03-31 | Paper |
| Complexity insights of the minimum duplication problem | 2014-03-27 | Paper |
| Parameterized complexity of \(k\)-anonymity: hardness and tractability | 2013-08-09 | Paper |
| Restricted and Swap Common Superstring: A Parameterized View | 2013-01-07 | Paper |
| The binary perfect phylogeny with persistent characters | 2012-10-11 | Paper |
| Complexity Insights of the Minimum Duplication Problem | 2012-06-15 | Paper |
| A randomized PTAS for the minimum consensus clustering with a fixed number of clusters | 2012-05-30 | Paper |
| On the parameterized complexity of the repetition free longest common subsequence problem | 2012-05-04 | Paper |
| Variants of constrained longest common subsequence | 2012-03-27 | Paper |
| Picture Languages Generated by Assembling Tiles | 2011-11-22 | Paper |
| Regular Splicing Languages Must Have a Constant | 2011-07-29 | Paper |
| Anonymizing binary and small tables is hard to approximate | 2011-06-17 | Paper |
| Parameterized Complexity of k-Anonymity: Hardness and Tractability | 2011-05-19 | Paper |
| A characterization of (regular) circular languages generated by monotone complete splicing systems | 2010-11-19 | Paper |
| Fingerprint clustering with bounded number of missing values | 2010-09-16 | Paper |
| On the regularity of circular splicing languages: a survey and new developments | 2010-09-16 | Paper |
| Constants and label-equivalence: a decision procedure for reflexive regular splicing languages | 2010-02-19 | Paper |
| The k-Anonymity Problem Is Hard | 2009-10-20 | Paper |
| Picture Languages Generated by Assembling Tiles | 2009-04-02 | Paper |
| A Decision Procedure for Reflexive Regular Splicing Languages | 2009-03-26 | Paper |
| Exemplar Longest Common Subsequence | 2008-12-09 | Paper |
| On the approximation of correlation clustering and consensus clustering | 2008-06-26 | Paper |
| Fingerprint Clustering with Bounded Number of Missing Values | 2007-09-14 | Paper |
| A linear-time algorithm for the perfect phylogeny haplotype problem | 2007-08-20 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Linear splicing and syntactic monoid | 2006-04-28 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Reconciling a gene tree to a species tree under the duplication cost model | 2005-12-29 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| On the power of circular splicing | 2005-09-28 | Paper |
| Regular splicing languages and subclasses | 2005-08-01 | Paper |
| The structure of reflexive regular splicing languages via Schützenberger constants | 2005-06-01 | Paper |
| The haplotyping problem: an overview of computational models and solutions | 2004-10-28 | Paper |
| Circular splicing and regularity | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452057 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437502 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412101 | 2003-07-13 | Paper |
| Separating some splicing models. | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529979 | 2002-05-07 | Paper |
| The complexity of multiple sequence alignment with SP-score that is a metric | 2001-08-20 | Paper |
| Nesting of prime substructures in \(k-\)ary relations | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723945 | 2001-07-08 | Paper |
| APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD | 2001-02-11 | Paper |
| An Algorithm for the Modular Decomposition of Hypergraphs | 2000-08-21 | Paper |
| Primitive 2-structures with the \((n-2)\)-property | 1994-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273665 | 1994-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273666 | 1994-01-13 | Paper |
| On automata on infinite trees | 1992-06-28 | Paper |
