COCOON 2006 - PDF Preprint Papers

COCOON 2006 International Conference on Computing and Combinatorics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCOON-2006 Paper

click to vote

COCOON
2006
Springer

169views Combinatorics» more COCOON 2006»

Reconciling Gene Trees with Apparent Polytomies

14 years 3 months ago

Download loco.biosci.arizona.edu

We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...

Wen-Chieh Chang 0002, Oliver Eulenstein

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	169	Reconciling Gene Trees with Apparent Polytomies	claim
2	156	On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis	claim
3	153	The Class Constrained Bin Packing Problem with Applications to Video-on-Demand	claim
4	128	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs	claim
5	121	Approximating Min-Max (Regret) Versions of Some Polynomial Problems	claim
6	120	The On-Line Heilbronn's Triangle Problem in d Dimensions	claim
7	120	Computing Maximum-Scoring Segments in Almost Linear Time	claim
8	120	Finding Patterns with Variable Length Gaps or Don't Cares	claim
9	119	Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms	claim
10	118	Optimal Acyclic Edge Colouring of Grid Like Graphs	claim
11	112	Creation and Growth of Components in a Random Hypergraph Process	claim
12	108	A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem	claim
13	108	Improved Algorithms for the Minmax Regret 1-Median Problem	claim
14	107	Overlap-Free Regular Languages	claim
15	107	Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands	claim
16	100	The Unpredictable Deviousness of Models	claim
17	99	Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard	claim
18	97	The Complexity of Black-Box Ring Problems	claim
19	97	A PTAS for Cutting Out Polygons with Lines	claim
20	96	A Detachment Algorithm for Inferring a Graph from Path Frequency	claim
21	95	Restricted Mesh Simplification Using Edge Contractions	claim
22	93	On Unfolding Lattice Polygons/Trees and Diameter-4 Trees	claim
23	93	Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size	claim
24	92	Varieties Generated by Certain Models of Reversible Finite Automata	claim
25	91	On Indecomposability Preserving Elimination Sequences	claim
26	91	Improved On-Line Broadcast Scheduling with Deadlines	claim
27	85	Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers