✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 7534 || Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference

✍ Scribed by Raphael, Ben; Tang, Jijun

Book ID: 120323605
Publisher: Springer Berlin Heidelberg
Year: 2012
Weight: 644 KB
Category: Article
ISBN: 364233122X
DOI: 10.1007/978-3-642-33122-0_10

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 7534 || An Optimal Reconciliation Algorithm for Gene Trees with Polytomies

✍ Raphael, Ben; Tang, Jijun 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 324 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 7434 || Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms

✍ Gudmundsson, Joachim; Mestre, Julián; Viglas, Taso 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 301 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 7534 || MORPH-PRO: A Novel Algorithm and Web Server for Protein Morphing

✍ Raphael, Ben; Tang, Jijun 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 293 KB

[Lecture Notes in Computer Science] Patt

[Lecture Notes in Computer Science] Pattern Recognition in Bioinformatics Volume 4774 || Ant-MST: An Ant-Based Minimum Spanning Tree for Gene Expression Data Clustering

✍ Rajapakse, Jagath C.; Schmidt, Bertil; Volkert, Gwenn 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 197 KB

This Book Constitutes The Refereed Proceedings Of The International Workshop On Pattern Recognition In Bioinformatics, Prib 2007, Held In Singapore In October 2007. The 38 Revised Full Papers Presented Were Carefully Reviewed And Selected From 125 Submissions. The Papers Discuss The Applications Of

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1178 || An algorithm for enumerating all directed spanning trees in a directed graph

✍ Asano, Tetsuo; Igarashi, Yoshihide; Nagamochi, Hiroshi; Miyano, Satoru; Suri, Su 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 418 KB

[Lecture Notes in Computer Science] Lear

[Lecture Notes in Computer Science] Learning Theory Volume 3120 || Oracle Bounds and Exact Algorithm for Dyadic Classification Trees

✍ Shawe-Taylor, John; Singer, Yoram 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 226 KB