Sciweavers

2382 search results - page 77 / 477
» Generating Seeded Trees from Data Sets
Sort
View
WSCG
2004
138views more  WSCG 2004»
15 years 5 months ago
Efficient Clothing Fitting from Data
A major drawback of shopping for clothes on-line is that the customer cannot try on clothes and see if they fit or suit them. One solution is to display clothing on an avatar, a 3...
Marco Gillies, Daniel Ballin, Balázs Csan&a...
ORL
2008
99views more  ORL 2008»
15 years 4 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
RECOMB
2008
Springer
16 years 4 months ago
Locating Multiple Gene Duplications through Reconciled Trees
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
J. Gordon Burleigh, Mukul S. Bansal, André ...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 5 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
BMCBI
2010
108views more  BMCBI 2010»
15 years 4 months ago
iGTP: A software package for large-scale gene tree parsimony analysis
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
Ruchi Chaudhary, Mukul S. Bansal, André Weh...