| Publication | Date of Publication | Type |
|---|
On some open problems concerning the complexity of cellular arrays
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Approximating shortest superstrings with constraints
Lecture Notes in Computer Science | 2023-01-18 | Paper |
| OMGS: optical map-based genome scaffolding | 2019-05-21 | Paper |
On the approximation of shortest common supersequences and longest common subsequences
Automata, Languages and Programming | 2019-04-29 | Paper |
New decidability results concerning two-way counter machines and applications
Automata, Languages and Programming | 2019-03-29 | Paper |
Inclusion is undecidable for pattern languages
Automata, Languages and Programming | 2019-03-29 | Paper |
On the minimum common integer partition problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Algorithmica | 2018-05-18 | Paper |
Lower bounds on learning decision lists and trees
STACS 95 | 2017-12-04 | Paper |
Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
IEEE Transactions on Signal Processing | 2017-09-08 | Paper |
Aligning sequences via an evolutionary tree: complexity and approximation
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Two heads are better than two tapes
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Lecture Notes in Computer Science | 2015-10-29 | Paper |
A lower bound on the average-case complexity of shellsort
Journal of the ACM | 2015-09-19 | Paper |
| scientific article; zbMATH DE number 6472615 (Why is no real title available?) | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6472618 (Why is no real title available?) | 2015-08-14 | Paper |
Uniformly asymptotic behavior of ruin probabilities in a time-dependent renewal risk model with stochastic return
Journal of Computational and Applied Mathematics | 2015-06-02 | Paper |
k one-way heads cannot do string-matching
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| Fast elimination of redundant linear equations and reconstruction of recombination-free Mendelian inheritance on a pedigree | 2014-12-18 | Paper |
An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants
Algorithmica | 2012-04-26 | Paper |
Beyond evolutionary trees
Natural Computing | 2010-09-16 | Paper |
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops
Journal of Combinatorial Optimization | 2010-04-26 | Paper |
Average-case analysis of quicksort and binary insertion tree height using incompressibility
Information Processing Letters | 2010-03-24 | Paper |
More reliable protein NMR peak assignment via improved 2-interval scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations
SIAM Journal on Computing | 2010-01-06 | Paper |
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract)
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
Combinatorial Pattern Matching | 2009-07-07 | Paper |
On the approximation of correlation clustering and consensus clustering
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Finding Additive Biclusters with Random Background
Combinatorial Pattern Matching | 2008-06-17 | Paper |
| On computing the nearest neighbor interchange distance | 2008-04-14 | Paper |
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling | 2007-12-20 | Paper |
A Parsimony Approach to Genome-Wide Ortholog Assignment
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Complexity and approximation of the minimum recombinant haplotype configuration problem
Theoretical Computer Science | 2007-07-09 | Paper |
DNA sequencing and string learning
Mathematical Systems Theory | 2007-06-11 | Paper |
On the Minimum Common Integer Partition Problem
Lecture Notes in Computer Science | 2007-05-02 | Paper |
The longest common subsequence problem for arc-annotated sequences
Journal of Discrete Algorithms | 2007-04-26 | Paper |
A network flow approach to the minimum common integer partition problem
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 |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
A further improved approximation algorithm for breakpoint graph decomposition
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
| scientific article; zbMATH DE number 2119752 (Why is no real title available?) | 2004-11-29 | Paper |
Selecting the branches for an evolutionary tree.
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080275 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079851 (Why is no real title available?) | 2004-08-03 | Paper |
A heuristic algorithm for multiple sequence alignment based on blocks
Journal of Combinatorial Optimization | 2004-01-07 | Paper |
| scientific article; zbMATH DE number 1945156 (Why is no real title available?) | 2003-07-02 | Paper |
Computing Phylogenetic Roots with Bounded Degrees and Errors
SIAM Journal on Computing | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1929960 (Why is no real title available?) | 2003-06-18 | Paper |
Approximation algorithms for NMR spectral peak assignment.
Theoretical Computer Science | 2003-05-25 | Paper |
The longest common subsequence problem for sequences with nested arc annotations.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1830750 (Why is no real title available?) | 2002-11-18 | Paper |
The average‐case area of Heilbronn‐type triangles*
Random Structures & Algorithms | 2002-08-08 | Paper |
| scientific article; zbMATH DE number 1696638 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1754611 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1408350 (Why is no real title available?) | 2002-01-24 | Paper |
Aligning DNA sequences to minimize the change in protein
Journal of Combinatorial Optimization | 2001-11-21 | Paper |
| scientific article; zbMATH DE number 1615278 (Why is no real title available?) | 2001-07-08 | Paper |
A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
SIAM Journal on Computing | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1555959 (Why is no real title available?) | 2001-01-24 | Paper |
On the linear-cost subtree-transfer distance between phylogenetic trees
Algorithmica | 2001-01-14 | Paper |
| scientific article; zbMATH DE number 1424545 (Why is no real title available?) | 2000-11-06 | Paper |
A More Efficient Approximation Scheme for Tree Alignment
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1405796 (Why is no real title available?) | 2000-09-10 | Paper |
Pattern languages with and without erasing
International Journal of Computer Mathematics | 2000-07-04 | Paper |
New applications of the incompressibility method. II
Theoretical Computer Science | 2000-06-04 | Paper |
| scientific article; zbMATH DE number 1445316 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1405647 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1302179 (Why is no real title available?) | 2000-04-17 | Paper |
Optimal Information Gathering on the Internet with Time and Cost Constraints
SIAM Journal on Computing | 2000-03-19 | Paper |
New Applications of the Incompressibility Method
The Computer Journal | 2000-01-17 | Paper |
Average-case analysis of algorithms using Kolmogorov complexity
Journal of Computer Science and Technology | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1305446 (Why is no real title available?) | 1999-11-01 | Paper |
On the complexity and approximation of syntenic distance
Discrete Applied Mathematics | 1999-06-20 | Paper |
| scientific article; zbMATH DE number 1300964 (Why is no real title available?) | 1999-06-16 | Paper |
Mapping clones with a given ordering or interleaving
Algorithmica | 1998-11-01 | Paper |
Two heads are better than two tapes
Journal of the ACM | 1998-02-17 | Paper |
Two heads are better than two tapes
Journal of the ACM | 1998-02-17 | Paper |
On the complexity of comparing evolutionary trees
Discrete Applied Mathematics | 1997-11-25 | Paper |
\(k\) one-way heads cannot do string-matching
Journal of Computer and System Sciences | 1997-11-18 | Paper |
Rotations of Periodic Strings and Short Superstrings
Journal of Algorithms | 1997-10-20 | Paper |
| An approximation scheme for some Steiner tree problems in the plane | 1997-07-15 | Paper |
Approximation algorithms for tree alignment with a given phylogeny
Algorithmica | 1997-05-25 | Paper |
Alignment of trees -- an alternative to tree edit
Theoretical Computer Science | 1997-02-28 | Paper |
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
SIAM Journal on Computing | 1997-01-02 | Paper |
Lower bounds on learning decision lists and trees
Information and Computation | 1996-07-03 | Paper |
Approximating shortest superstrings with constraints
Theoretical Computer Science | 1996-04-01 | Paper |
New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing | 1996-01-02 | Paper |
| scientific article; zbMATH DE number 776086 (Why is no real title available?) | 1995-09-27 | Paper |
Decision problems for patterns
Journal of Computer and System Sciences | 1995-06-08 | Paper |
| scientific article; zbMATH DE number 512842 (Why is no real title available?) | 1994-11-13 | Paper |
Linear approximation of shortest superstrings
Journal of the ACM | 1994-11-03 | Paper |
ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
International Journal of Foundations of Computer Science | 1994-04-27 | Paper |
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters | 1994-04-05 | Paper |
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
Theoretical Computer Science | 1994-04-05 | Paper |
Minimal NFA Problems are Hard
SIAM Journal on Computing | 1994-02-07 | Paper |
On the complexity of learning strings and sequences
Theoretical Computer Science | 1993-11-28 | Paper |
| scientific article; zbMATH DE number 176769 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176142 (Why is no real title available?) | 1993-05-18 | Paper |
A note on shortest superstrings with flipping
Information Processing Letters | 1993-05-16 | Paper |
On Efficient Parallel Algorithms for Solving Set Recurrence Equations
Journal of Algorithms | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 88942 (Why is no real title available?) | 1993-01-16 | Paper |
A characterization of exponential-time languages by alternating context- free grammars
Theoretical Computer Science | 1992-09-27 | Paper |
A hierarchy result for 2-dimensional TM's operating in small space
Information Sciences | 1992-09-27 | Paper |
A note on the space complexity of some decision problems for finite automata
Information Processing Letters | 1992-06-28 | Paper |
THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
International Journal of Foundations of Computer Science | 1992-06-28 | Paper |
Parallel parsing on a one-way linear array of finite-state machines
Theoretical Computer Science | 1992-06-28 | Paper |
The synchronization of nonuniform networks of finite automata
Information and Computation | 1992-06-28 | Paper |
Learning regular languages from counterexamples
Journal of Computer and System Sciences | 1992-06-25 | Paper |
Some classes of languages in \(NC^ 1\)
Information and Computation | 1991-01-01 | Paper |
The Power of Alternating One-Reversal Counters and Stacks
SIAM Journal on Computing | 1991-01-01 | Paper |
Systolic algorithms for some scheduling and graph problems
Journal of VLSI signal processing systems for signal, image and video technology | 1990-01-01 | Paper |
On the complexity of 1-tape ATMs and off-line 1-tape ATMs running in constant reversals
Theoretical Computer Science | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4205997 (Why is no real title available?) | 1989-01-01 | Paper |
Optimal simulation of tree arrays by linear arrays
Information Processing Letters | 1989-01-01 | Paper |
On iterative and cellular tree arrays
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Some subclasses of context-free languages in \(NC^ 1\)
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4080911 (Why is no real title available?) | 1988-01-01 | Paper |
Relating the power of cellular arrays to their closure properties
Theoretical Computer Science | 1988-01-01 | Paper |
On One-Way Cellular Arrays
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4028909 (Why is no real title available?) | 1987-01-01 | Paper |
