Back to Results
First PageMeta Content
Schedule / Binary trees / Tree / B-tree / Minimum spanning tree / Tree decomposition / Graph theory / Data management / Data


On Reconstructing Species Trees From Gene Trees In Term Of Duplications And Losses  y
Add to Reading List

Document Date: 2007-07-24 12:39:54

Open Document

File Size: 265,30 KB

Share Result on Facebook

City

Berlin / Bonn / New York / Waterloo / /

Company

Columbia University Press / M. Steel / Matsuda / Case / G.W. Moore A.E. / /

Country

Germany / Canada / China / /

Currency

pence / /

/

Facility

City University of Hong Kong / National University of Singapore / University of Waterloo / Beijing University / Institute of Systems Science / /

IndustryTerm

polynomial algorithms / heuristic algorithms / cient algorithm / cient search / nearest neighbor interchange searching algorithm / approximation algorithms / /

Organization

National University of Singapore / Singapore / Columbia University / Institute of Systems Science / Department of Computer Science / Beijing University / Beijing / Department of Mathematics / University of Waterloo / City University of Hong Kong / BioInformatics Center / /

Person

Ming Li / Let lca (Ain) / Louxin Zhang Abstract / Optimal Species / Gene Trees / Optimal Species Tree / /

Position

model for gene relationship / VP / General / /

Product

T10 / Galil / /

ProvinceOrState

New York / Ontario / /

PublishedMedium

Molecular Phylogenetics and Evolution / /

Technology

BioInformatics / approximation algorithms / nearest neighbor interchange searching algorithm / polynomial algorithms / cient algorithm / /

SocialTag