| Publication | Date of Publication | Type |
|---|
MUL-tree pruning for consistency and compatibility
| 2024-10-21 | Paper |
Finding the cyclic covers of a string
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Computing the unrooted maximum agreement subtree in sub-quadratic time
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
A faster construction of greedy consensus trees
| 2021-07-28 | Paper |
Computing the rooted triplet distance between phylogenetic networks
Algorithmica | 2021-06-11 | Paper |
Efficient identification of \(k\)-closed strings
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
A linear time algorithm for the \(r\)-gathering problem on the line
Theoretical Computer Science | 2021-04-14 | Paper |
Computing the rooted triplet distance between phylogenetic networks
Lecture Notes in Computer Science | 2020-02-25 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract)
| 2019-10-15 | Paper |
Greedy consensus tree and maximum greedy consensus tree problems
| 2019-10-15 | Paper |
Off-line and on-line algorithms for closed string factorization
Theoretical Computer Science | 2019-10-07 | Paper |
Improved Algorithms for Constructing Consensus Trees
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Improved algorithms for constructing consensus trees
Journal of the ACM | 2018-08-02 | Paper |
Computing asymmetric median tree of two trees via better bipartite matching algorithm
| 2018-06-15 | Paper |
Faster algorithms for 1-mappability of a sequence
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Determining the consistency of resolved triplets and fan triplets
| 2018-03-22 | Paper |
scientific article; zbMATH DE number 6851886 (Why is no real title available?)
| 2018-03-21 | Paper |
On finding the Adams consensus tree
Information and Computation | 2017-09-28 | Paper |
An efficient algorithm for the rooted triplet distance between galled trees
| 2017-07-25 | Paper |
On finding the Adams consensus tree
| 2017-01-24 | Paper |
Faster algorithms for computing the R* consensus tree
Algorithmica | 2016-12-21 | Paper |
Faster algorithms for computing the R* consensus tree
Algorithms and Computation | 2015-09-11 | Paper |
Linked dynamic tries with applications to LZ-compression in sublinear time and space
Algorithmica | 2015-06-25 | Paper |
Ultra-succinct representation of ordered trees
| 2014-12-18 | Paper |
Algorithms for combining rooted triplets into a galled phylogenetic network
| 2014-10-13 | Paper |
Partial convex recolorings of trees and galled networks
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Fast relative Lempel-Ziv self-index for similar sequences
Theoretical Computer Science | 2014-04-15 | Paper |
Compressed directed acyclic word graph with application in local alignment
Algorithmica | 2013-11-11 | Paper |
Computing the maximum agreement of phylogenetic networks
| 2013-08-30 | Paper |
CRAM: compressed random access memory
Automata, Languages, and Programming | 2013-08-12 | Paper |
Constructing the R* consensus tree of two trees in subcubic time
Algorithmica | 2013-05-13 | Paper |
Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees
| 2013-03-19 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Fast relative Lempel-Ziv self-index for similar sequences
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences | 2012-05-11 | Paper |
A linear size index for approximate pattern matching
Journal of Discrete Algorithms | 2012-01-04 | Paper |
Algorithms for building consensus MUL-trees
Algorithms and Computation | 2011-12-16 | Paper |
Succinct data structures for searchable partial sums with optimal worst-case performance
Theoretical Computer Science | 2011-10-10 | Paper |
On all-substrings alignment problems
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Improved algorithms for maximum agreement and compatible supertrees
Algorithmica | 2011-03-02 | Paper |
Compressed indexes for approximate string matching
Algorithmica | 2010-09-16 | Paper |
Constructing the R* consensus tree of two trees in subcubic time
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Indexing similar DNA sequences
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Breaking a time-and-space barrier in constructing full-text indices
SIAM Journal on Computing | 2010-01-06 | Paper |
Computing a smallest multi-labeled phylogenetic tree from rooted triplets
Algorithms and Computation | 2009-12-17 | Paper |
Algorithms in bioinformatics. A practical introduction.
| 2009-10-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Non-shared edges and nearest neighbor interchanges revisited
Information Processing Letters | 2009-07-21 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
An Experimental Study of Compressed Indexing and Local Alignments of DNA
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Non-overlapping common substrings allowing mutations
Mathematics in Computer Science | 2008-09-08 | Paper |
Improved approximate string matching using compressed suffix data structures
Algorithmica | 2008-07-01 | Paper |
Space Efficient Indexes for String Matching with Don’t Cares
Algorithms and Computation | 2008-05-27 | Paper |
Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Compressed Indexes for Approximate String Matching
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A Linear Size Index for Approximate Pattern Matching
Combinatorial Pattern Matching | 2007-09-14 | Paper |
A space and time efficient algorithm for constructing compressed suffix arrays
Algorithmica | 2007-07-19 | Paper |
Fast algorithms for computing the tripartition-based distance between phylogenetic networks
Journal of Combinatorial Optimization | 2007-07-19 | Paper |
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment
Algorithmica | 2006-11-06 | Paper |
Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
SIAM Journal on Computing | 2006-06-01 | Paper |
Approximate string matching using compressed suffix arrays
Theoretical Computer Science | 2006-03-24 | Paper |
Rooted maximum agreement supertrees
Algorithmica | 2006-03-21 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science | 2005-06-10 | Paper |
SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES
International Journal of Foundations of Computer Science | 2005-02-28 | Paper |
scientific article; zbMATH DE number 2089995 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2080270 (Why is no real title available?)
| 2004-08-04 | Paper |
The enhanced double digest problem for DNA physical mapping
Journal of Combinatorial Optimization | 2003-10-27 | Paper |
scientific article; zbMATH DE number 1945178 (Why is no real title available?)
| 2003-07-02 | Paper |
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings
Journal of Algorithms | 2002-04-08 | Paper |
scientific article; zbMATH DE number 1617274 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1615276 (Why is no real title available?)
| 2001-07-08 | Paper |
A decomposition theorem for maximum weight bipartite matchings
SIAM Journal on Computing | 2001-06-21 | Paper |
scientific article; zbMATH DE number 1559522 (Why is no real title available?)
| 2001-02-28 | Paper |
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
SIAM Journal on Computing | 2000-10-18 | Paper |
scientific article; zbMATH DE number 1444320 (Why is no real title available?)
| 2000-05-09 | Paper |
scientific article; zbMATH DE number 1405800 (Why is no real title available?)
| 2000-03-27 | Paper |
scientific article; zbMATH DE number 1104338 (Why is no real title available?)
| 1998-07-27 | Paper |
scientific article; zbMATH DE number 1002201 (Why is no real title available?)
| 1997-04-22 | Paper |
