Sciweavers

91 search results - page 16 / 19
» A supertree method for rooted trees
Sort
View
90
Voted
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 1 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
BMCBI
2004
94views more  BMCBI 2004»
15 years 6 days ago
GASP: Gapped Ancestral Sequence Prediction for proteins
Background: The prediction of ancestral protein sequences from multiple sequence alignments is useful for many bioinformatics analyses. Predicting ancestral sequences is not a sim...
Richard J. Edwards, Denis C. Shields
BMCBI
2005
93views more  BMCBI 2005»
15 years 7 days ago
Multiple sequence alignment accuracy and evolutionary distance estimation
Background: Sequence alignment is a common tool in bioinformatics and comparative genomics. It is generally assumed that multiple sequence alignment yields better results than pai...
Michael S. Rosenberg
ALMOB
2008
92views more  ALMOB 2008»
15 years 14 days ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You
139
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu