The following pages link to Dan Gusfield (Q793742):
Displayed 50 items.
- (Q232398) (redirect page) (← links)
- Matroid optimization with the interleaving of two ordered sets (Q793743) (← links)
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478) (← links)
- Parametric stable marriage and minimum cuts (Q913621) (← links)
- The three-state perfect phylogeny problem reduces to 2-SAT (Q966200) (← links)
- A new recombination lower bound and the minimum perfect phylogenetic forest problem (Q1029702) (← links)
- Equivalent approximation algorithms for node cover (Q1077934) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038) (← links)
- Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
- A faster parametric minimum-cut algorithm (Q1317480) (← links)
- Faster implementation of a shortest superstring approximation (Q1336759) (← links)
- Parametric optimization of sequence alignment (Q1336962) (← links)
- Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773) (← links)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125) (← links)
- Connectivity and edge-disjoint spanning trees (Q1837196) (← links)
- Efficient solution of the matroid product problem (Q2314409) (← links)
- The Fine Structure of Galls in Phylogenetic Networks (Q2890447) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- (Q3024791) (← links)
- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers (Q3082907) (← links)
- (Q3128908) (← links)
- Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test (Q3136617) (← links)
- (Q3138920) (← links)
- Speedup of RNA Pseudoknotted Secondary Structure Recurrence Computation with the Four-Russians Method (Q3167360) (← links)
- Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters (Q3225112) (← links)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)
- Very Simple Methods for All Pairs Network Flow Analysis (Q3496127) (← links)
- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants (Q3506918) (← links)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937) (← links)
- Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations (Q3596270) (← links)
- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem (Q3608827) (← links)
- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data (Q3608831) (← links)
- A note on Arc tolerances in sparse shortest-path and network flow problems (Q3661270) (← links)
- Fast Algorithms for Bipartite Network Flow (Q3754450) (← links)
- Optimal Mixed Graph Augmentation (Q3762349) (← links)
- Parametric Combinatorial Computing and a Problem of Program Module Distribution (Q3765242) (← links)
- Three Fast Algorithms for Four Problems in Stable Marriage (Q3774944) (← links)
- A Graph Theoretic Approach to Statistical Data Security (Q3799808) (← links)
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments (Q3819073) (← links)
- (Q3895490) (← links)
- (Q3907584) (← links)
- Computing the Strength of a Graph (Q3978173) (← links)
- Efficient algorithms for generalized cut‐trees (Q3978604) (← links)