Lecture Notes in Computer Science - Algorithms in Bioinformatics
Latest Publications

TOTAL DOCUMENTS

35

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642331213, 9783642331220

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

SibJoin: A Fast Heuristic for Half-Sibling Reconstruction

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_4 ◽

2012 ◽

pp. 44-56 ◽

Author(s):

Daniel G. Brown ◽

Daniel Dexter

Keyword(s):

Download Full-text

Improved Lower Bounds on the Compatibility of Quartets, Triplets, and Multi-state Characters

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_15 ◽

2012 ◽

pp. 190-200

Author(s):

Brad Shutters ◽

Sudheer Vakati ◽

David Fernández-Baca

Keyword(s):

Download Full-text

Succinct de Bruijn Graphs

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_18 ◽

2012 ◽

pp. 225-235 ◽

Author(s):

Alexander Bowe ◽

Taku Onodera ◽

Kunihiko Sadakane ◽

Tetsuo Shibuya

Keyword(s):

De Bruijn Graphs ◽

Download Full-text

Reconstructing the Evolution of Molecular Interaction Networks under the DMC and Link Dynamics Models

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_5 ◽

2012 ◽

pp. 57-68 ◽

Author(s):

Yun Zhu ◽

Luay Nakhleh

Keyword(s):

Molecular Interaction ◽

Interaction Networks ◽

Molecular Interaction Networks ◽

Dynamics Models

Download Full-text

An Optimal Reconciliation Algorithm for Gene Trees with Polytomies

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_9 ◽

2012 ◽

pp. 106-122 ◽

Author(s):

Manuel Lafond ◽

Krister M. Swenson ◽

Nadia El-Mabrouk

Keyword(s):

Download Full-text

Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_19 ◽

2012 ◽

pp. 236-248 ◽

Author(s):

Rayan Chikhi ◽

Guillaume Rizk

Keyword(s):

Bloom Filter ◽

Graph Representation ◽

De Bruijn Graph ◽

Download Full-text

Distributed String Mining for High-Throughput Sequencing Data

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_35 ◽

2012 ◽

pp. 441-452 ◽

Author(s):

Niko Välimäki ◽

Simon J. Puglisi

Keyword(s):

High Throughput ◽

High Throughput Sequencing ◽

Sequencing Data ◽

High Throughput Sequencing Data ◽

Download Full-text

DCJ-indel Distance with Distinct Operation Costs

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_30 ◽

2012 ◽

pp. 378-390 ◽

Author(s):

Poly H. da Silva ◽

Marília D. V. Braga ◽

Raphael Machado ◽

Simone Dantas

Keyword(s):

Operation Costs

Download Full-text

Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_2 ◽

2012 ◽

pp. 14-29 ◽

Author(s):

Daniel G. Brown ◽

Jakub Truszkowski

Keyword(s):

Phylogenetic Tree ◽

Locality Sensitive Hashing ◽

Tree Reconstruction ◽

Phylogenetic Tree Reconstruction

Download Full-text

Succinct Multibit Tree: Compact Representation of Multibit Trees by Using Succinct Data Structures in Chemical Fingerprint Searches

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-33122-0_16 ◽

2012 ◽

pp. 201-213 ◽

Author(s):

Yasuo Tabei

Keyword(s):

Data Structures ◽

Compact Representation ◽

Succinct Data Structures ◽

Chemical Fingerprint

Download Full-text