| Publication | Date of Publication | Type |
|---|
| PANTAS DATA | 2024-09-10 | Dataset |
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 7559196 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Computing the multi-string BWT and LCP array in external memory
Theoretical Computer Science | 2021-03-09 | 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 |
| Character-based phylogeny construction and its application to tumor evolution | 2017-08-04 | 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 |
When and how the perfect phylogeny model explains evolution
Discrete and Topological Models in Molecular Biology | 2014-06-23 | Paper |
Parameterized complexity of \(k\)-anonymity: hardness and tractability
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
Multiple sequence alignment as a facility-location problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
Theoretical Computer Science | 2012-05-30 | Paper |
Variants of constrained longest common subsequence
Information Processing Letters | 2012-03-27 | 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 |
Beyond evolutionary trees
Natural Computing | 2010-09-16 | Paper |
Fingerprint clustering with bounded number of missing values
Algorithmica | 2010-09-16 | Paper |
The k-Anonymity Problem Is Hard
Fundamentals of Computation Theory | 2009-10-20 | 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 |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Towards a theory of conservative computing
International Journal of Theoretical Physics | 2006-09-28 | Paper |
Reconciling a gene tree to a species tree under the duplication cost model
Theoretical Computer Science | 2005-12-29 | Paper |
Computational Methods in Systems Biology
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2119752 (Why is no real title available?) | 2004-11-29 | Paper |
The haplotyping problem: an overview of computational models and solutions
Journal of Computer Science and Technology | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2011850 (Why is no real title available?) | 2003-12-02 | 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 |
