✦ LIBER ✦

Computing the Maximum Agreement of Phylogenetic Networks

✍ Scribed by Charles Choy; Jesper Jansson; Kunihiko Sadakane; Wing-Kin Sung

Book ID: 108126306
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 240 KB
Volume: 91
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.12.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Kaikoura tree theorems: Computing the ma

Kaikoura tree theorems: Computing the maximum agreement subtree

✍ Mike Steel; Tandy Warnow 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Fast algorithms for computing the tripar

Fast algorithms for computing the tripartition-based distance between phylogenetic networks

✍ Nguyen Bao Nguyen; C. Thach Nguyen; Wing-Kin Sung 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 577 KB

The Use of a Synchronizer Yields the Max

The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks

✍ S. Even; S. Rajsbaum 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 230 KB

Improving time bounds on maximum general

Improving time bounds on maximum generalised flow computations by contracting the network

✍ Tomasz Radzik 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We consider the maximum generalised network ow problem and a supply-scaling algorithmic framework for this problem. We present three network-modiÿcation operations, which may signiÿcantly decrease the size of the network when the remaining node supplies become small. We use these three operations in

Computing the Distribution of the Maximu

Computing the Distribution of the Maximum of Gaussian Random Processes

✍ Christine Cierco-Ayrolles; Alain Croquette; Céline Delmas 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 130 KB

Computing the maximum generalized invers

Computing the maximum generalized inverse of a Boolean matrix

✍ D.G. Fitz-Gerald 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 249 KB