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

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 1276 || Tree structure genetic algorithm with a nourishment mechanism

✍ Jiang, Tao; Lee, D. T. 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 608 KB

This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on

[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] Algo

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

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

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1969 || Undecidability Results for Monoids with Linear-Time Decidable Word Problems

✍ Goos, Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Lee, D. T.; Teng, Shang-Hua 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 181 KB

The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taip

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1969 || Undecidability Results for Monoids with Linear-Time Decidable Word Problems

✍ Goos, Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Lee, D. T.; Teng, Shang-Hua 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 181 KB

The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taip