Sciweavers

83 search results - page 7 / 17
» Upper bounds on maximum likelihood for phylogenetic trees
Sort
View
BMCBI
2005
134views more  BMCBI 2005»
13 years 10 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
14 years 16 days ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
JCB
2006
124views more  JCB 2006»
13 years 10 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 8 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
TCOM
2010
142views more  TCOM 2010»
13 years 5 months ago
Performance Bounds and Distance Spectra of Variable Length Codes in Turbo/Concatenated Systems
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
Xavier Jaspar, Luc Vandendorpe