Sciweavers

    COCOON   2006 International Conference on Computing and Combinatorics
    Wall of Fame | Most Viewed COCOON-2006 Paper
    COCOON
    2006
    Springer
    169views Combinatorics» more  COCOON 2006»
    Reconciling Gene Trees with Apparent Polytomies
    13 years 8 months ago
    Reconciling Gene Trees with Apparent Polytomies
    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.
    IdReadViewsTitleStatus
    1Download preprint from source169
    Reconciling Gene Trees with Apparent Polytomies
    claim
    2Download preprint from source156
    On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
    claim
    3Download preprint from source153
    The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
    claim
    4Download preprint from source128
    Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
    claim
    5Download preprint from source121
    Approximating Min-Max (Regret) Versions of Some Polynomial Problems
    claim
    6Download preprint from source120
    The On-Line Heilbronn's Triangle Problem in d Dimensions
    claim
    7Download preprint from source120
    Computing Maximum-Scoring Segments in Almost Linear Time
    claim
    8Download preprint from source120
    Finding Patterns with Variable Length Gaps or Don't Cares
    claim
    9Download preprint from source119
    Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
    claim
    10Download preprint from source118
    Optimal Acyclic Edge Colouring of Grid Like Graphs
    claim
    11Download preprint from source112
    Creation and Growth of Components in a Random Hypergraph Process
    claim
    12Download preprint from source108
    A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
    claim
    13Download preprint from source108
    Improved Algorithms for the Minmax Regret 1-Median Problem
    claim
    14Download preprint from source107
    Overlap-Free Regular Languages
    claim
    15Download preprint from source107
    Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
    claim
    16Download preprint from source100
    The Unpredictable Deviousness of Models
    claim
    17Download preprint from source99
    Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
    claim
    18Download preprint from source97
    The Complexity of Black-Box Ring Problems
    claim
    19Download preprint from source97
    A PTAS for Cutting Out Polygons with Lines
    claim
    20Download preprint from source96
    A Detachment Algorithm for Inferring a Graph from Path Frequency
    claim
    21Download preprint from source95
    Restricted Mesh Simplification Using Edge Contractions
    claim
    22Download preprint from source93
    On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
    claim
    23Download preprint from source93
    Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
    claim
    24Download preprint from source92
    Varieties Generated by Certain Models of Reversible Finite Automata
    claim
    25Download preprint from source91
    On Indecomposability Preserving Elimination Sequences
    claim
    26Download preprint from source91
    Improved On-Line Broadcast Scheduling with Deadlines
    claim
    27Download preprint from source85
    Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
    claim
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.