Search Results - "Gusfield, Dan"
-
1
Linear time algorithms for finding and representing all the tandem repeats in a string
Published in Journal of computer and system sciences (01-12-2004)“…A tandem repeat (or square) is a string αα, where α is a non-empty string. We present an O(| S|)-time algorithm that operates on the suffix tree T( S) for a…”
Get full text
Journal Article -
2
Constructing perfect phylogenies and proper triangulations for three-state characters
Published in Algorithms for molecular biology (24-09-2012)“…: In this paper, we study the problem of constructing perfect phylogenies for three-state characters. Our work builds on two recent results. The first result…”
Get full text
Journal Article -
3
A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem
Published in Journal of computational biology (01-03-2006)“…Since the introduction of the Perfect Phylogeny Haplotyping (PPH) Problem in RECOMB 2002 (Gusfield, 2002), the problem of finding a linear-time (deterministic,…”
Get more information
Journal Article -
4
The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory
Published in Journal of computational biology (01-03-2010)“…The Multi-State Perfect Phylogeny Problem is an extension of the Binary Perfect Phylogeny Problem, allowing characters to take on more than two states. In this…”
Get more information
Journal Article -
5
An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding
Published in Algorithms for molecular biology (05-08-2016)“…The basic RNA secondary structure prediction problem or single sequence folding problem (SSF) was solved 35 years ago by a now well-known [Formula: see…”
Get full text
Journal Article -
6
Partition-distance: A problem and class of perfect graphs arising in clustering
Published in Information processing letters (16-05-2002)“…Partitioning of a set of elements into disjoint clusters is a fundamental problem that arises in many applications. Different methods produce different…”
Get full text
Journal Article -
7
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
Published in Journal of computer and system sciences (01-05-2005)“…Phylogenetic networks are models of sequence evolution that go beyond trees, allowing biological operations that are not consistent with tree-like evolution…”
Get full text
Journal Article -
8
-
9
-
10
-
11
-
12
-
13
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound
Published in IEEE/ACM transactions on computational biology and bioinformatics (01-03-2017)“…Evolutionary data has been traditionally modeled via phylogenetic trees; however, branching alone cannot model conflicting phylogenetic signals, so networks…”
Get full text
Journal Article -
14
Faster algorithms for RNA-folding using the Four-Russians method
Published in Algorithms for molecular biology (06-03-2014)“…The secondary structure that maximizes the number of non-crossing matchings between complimentary bases of an RNA sequence of length n can be computed in O(n3)…”
Get full text
Journal Article -
15
Final, Five-Year End, Editorial
Published in IEEE/ACM transactions on computational biology and bioinformatics (01-01-2009)Get full text
Journal Article -
16
Outgoing EIC Editorial for this Special Section of TCBB with the Theme of Phylogenetics
Published in IEEE/ACM transactions on computational biology and bioinformatics (01-01-2009)Get full text
Journal Article -
17
A simple, practical and complete O(n3/log n)-time algorithm for RNA folding using the Four-Russians speedup
Published in Algorithms for molecular biology (04-01-2010)“…The problem of computationally predicting the secondary structure (or folding) of RNA molecules was first introduced more than thirty years ago and yet…”
Get full text
Journal Article -
18
EIC Editorial
Published in IEEE/ACM transactions on computational biology and bioinformatics (01-10-2008)Get full text
Journal Article -
19
Inference of haplotypes from samples of diploid populations: complexity and algorithms
Published in Journal of computational biology (01-01-2001)“…The next phase of human genomics will involve large-scale screens of populations for significant DNA polymorphisms, notably single nucleotide polymorphisms…”
Get more information
Journal Article -
20
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study
Published in Discrete Applied Mathematics (01-04-2007)“…Phylogenetic networks are models of sequence evolution that go beyond trees, allowing biological operations that are not tree-like. One of the most important…”
Get full text
Journal Article