Lecture Notes in Computer Science - Algorithms in Bioinformatics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642230370, 9783642230387

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Speeding Up Bayesian HMM by the Four Russians Method

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_17 ◽

2011 ◽

pp. 188-200 ◽

Cited By ~ 1

Author(s):

Md Pavel Mahmud ◽

Alexander Schliep

Download Full-text

Boosting Binding Sites Prediction Using Gene’s Positions

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_9 ◽

2011 ◽

pp. 92-103 ◽

Cited By ~ 3

Author(s):

Mohamed Elati ◽

Rim Fekih ◽

Rémy Nicolle ◽

Ivan Junier ◽

Joan Hérisson ◽

...

Keyword(s):

Binding Sites

Download Full-text

Graph-Based Decomposition of Biochemical Reaction Networks into Monotone Subsystems

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_13 ◽

2011 ◽

pp. 139-150 ◽

Cited By ~ 2

Author(s):

Hans-Michael Kaltenbach ◽

Simona Constantinescu ◽

Justin Feigelman ◽

Jörg Stelling

Keyword(s):

Biochemical Reaction ◽

Reaction Networks ◽

Biochemical Reaction Networks

Download Full-text

Learning Protein Functions from Bi-relational Graph of Proteins and Function Annotations

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_12 ◽

2011 ◽

pp. 128-138 ◽

Cited By ~ 8

Author(s):

Jonathan Qiang Jiang

Keyword(s):

Protein Functions ◽

And Function

Download Full-text

OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_30 ◽

2011 ◽

pp. 364-375 ◽

Cited By ~ 11

Author(s):

Chunfang Zheng ◽

Krister Swenson ◽

Eric Lyons ◽

David Sankoff

Keyword(s):

Multiple Genomes

Download Full-text

A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_22 ◽

2011 ◽

pp. 250-269 ◽

Cited By ~ 5

Author(s):

Yann Ponty ◽

Cédric Saule

Download Full-text

Removing Noise from Gene Trees

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_8 ◽

2011 ◽

pp. 76-91 ◽

Cited By ~ 5

Author(s):

Andrea Doroftei ◽

Nadia El-Mabrouk

Keyword(s):

Gene Trees

Download Full-text

Separating Metagenomic Short Reads into Genomes via Clustering

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_25 ◽

2011 ◽

pp. 298-313 ◽

Cited By ~ 3

Author(s):

Olga Tanaseichuk ◽

James Borneman ◽

Tao Jiang

Keyword(s):

Short Reads

Download Full-text

Localized Genome Assembly from Reads to Scaffolds: Practical Traversal of the Paired String Graph

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_4 ◽

2011 ◽

pp. 39-48 ◽

Cited By ~ 10

Author(s):

Rayan Chikhi ◽

Dominique Lavenier

Keyword(s):

Genome Assembly ◽

String Graph

Download Full-text

Maximum Likelihood Estimation of Incomplete Genomic Spectrum from HTS Data

Lecture Notes in Computer Science - Algorithms in Bioinformatics ◽

10.1007/978-3-642-23038-7_19 ◽

2011 ◽

pp. 213-224 ◽

Cited By ~ 1

Author(s):

Serghei Mangul ◽

Irina Astrovskaya ◽

Marius Nicolae ◽

Bassam Tork ◽

Ion Mandoiu ◽

...

Keyword(s):

Maximum Likelihood ◽

Maximum Likelihood Estimation ◽

Likelihood Estimation

Download Full-text

Lecture Notes in Computer Science - Algorithms in BioinformaticsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Speeding Up Bayesian HMM by the Four Russians Method

Boosting Binding Sites Prediction Using Gene’s Positions

Graph-Based Decomposition of Biochemical Reaction Networks into Monotone Subsystems

Learning Protein Functions from Bi-relational Graph of Proteins and Function Annotations

OMG! Orthologs in Multiple Genomes – Competing Graph-Theoretical Formulations

A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms

Removing Noise from Gene Trees

Separating Metagenomic Short Reads into Genomes via Clustering

Localized Genome Assembly from Reads to Scaffolds: Practical Traversal of the Paired String Graph

Maximum Likelihood Estimation of Incomplete Genomic Spectrum from HTS Data

Lecture Notes in Computer Science - Algorithms in Bioinformatics
Latest Publications