✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 3240 || Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction

✍ Scribed by Jonassen, Inge; Kim, Junhyong

Book ID: 121490003
Publisher: Springer Berlin Heidelberg
Year: 2004
Weight: 211 KB
Category: Article
ISBN: 3540302190
DOI: 10.1007/978-3-540-30219-3_23

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 2452 || Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem

✍ Guigó, Roderic; Gusfield, Dan 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 731 KB

We are pleased to present the proceedings of the Second Workshop on Al- rithms in Bioinformatics (WABI 2002), which took place on September 17-21, 2002 in Rome, Italy. The WABI workshop was part of a three-conference me- ing, which, in addition to WABI, included the ESA and APPROX 2002. The three co

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2223 || A Fast Algorithm for Enumerating Bipartite Perfect Matchings

✍ Eades, Peter; Takaoka, Tadao 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 187 KB

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Data and Web Management Volume 5446 || A Fast Heuristic Algorithm for the Composite Web Service Selection

✍ Li, Qing; Feng, Ling; Pei, Jian; Wang, Sean X.; Zhou, Xiaofang; Zhu, Qiao-Ming 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 279 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Drawing Volume 3383 || A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction

✍ Pach, János 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 174 KB

This Book Constitutes The Thoroughly Refereed Post-proceedings Of The 12th International Symposium On Graph Drawing, Gd 2004, Held In New York, Ny, Usa In September/october 2004. The 39 Revised Full Papers And 12 Revised Short Papers Presented Together With 4 Posters And A Report On The Graph Drawin

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Compiler Construction Volume 4420 || A Fast Cutting-Plane Algorithm for Optimal Coalescing

✍ Krishnamurthi, Shriram; Odersky, Martin 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 479 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Vision – ACCV 2007 Volume 4844 || A Fast Optimal Algorithm for L 2 Triangulation

✍ Yagi, Yasushi; Kang, Sing Bing; Kweon, In So; Zha, Hongbin 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 574 KB

Yasushi Yagi ... [et Al.] (eds.). Includes Bibliographical References And Index. Also Issued Online.