Algorithms in Bioinformatics

14th International Workshop, WABI 2014, Wroclaw, Poland, September 8-10, 2014. Proceedings

  • Dan Brown
  • Burkhard Morgenstern
Conference proceedings WABI 2014

DOI: 10.1007/978-3-662-44753-6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8701)

Table of contents (27 papers)

  1. Front Matter
  2. QCluster: Extending Alignment-Free Measures with Quality Values for Reads Clustering
    Matteo Comin, Andrea Leoni, Michele Schimd
    Pages 1-13
  3. Improved Approximation for the Maximum Duo-Preservation String Mapping Problem
    Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
    Pages 14-25
  4. A Faster 1.375-Approximation Algorithm for Sorting by Transpositions
    Luís Felipe I. Cunha, Luis Antonio B. Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
    Pages 26-37
  5. A Generalized Cost Model for DCJ-Indel Sorting
    Phillip E. C. Compeau
    Pages 38-51
  6. Efficient Indexed Alignment of Contigs to Optical Maps
    Martin D. Muggli, Simon J. Puglisi, Christina Boucher
    Pages 68-81
  7. Navigating in a Sea of Repeats in RNA-seq without Drowning
    Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix
    Pages 82-96
  8. Linearization of Median Genomes under DCJ
    Shuai Jiang, Max A. Alekseyev
    Pages 97-106
  9. An LP-Rounding Algorithm for Degenerate Primer Design
    Yu-Ting Huang, Marek Chrobak
    Pages 107-121
  10. GAML: Genome Assembly by Maximum Likelihood
    Vladimír Boža, Broňa Brejová, Tomáš Vinař
    Pages 122-134
  11. Estimating Evolutionary Distances from Spaced-Word Matches
    Burkhard Morgenstern, Binyao Zhu, Sebastian Horwege, Chris-André Leimeister
    Pages 161-173
  12. On the Family-Free DCJ Distance
    Fábio V. Martinez, Pedro Feijão, Marília D. V. Braga, Jens Stoye
    Pages 174-186
  13. New Algorithms for Computing Phylogenetic Biodiversity
    Constantinos Tsirogiannis, Brody Sandel, Adrija Kalvisa
    Pages 187-203
  14. The Divisible Load Balance Problem and Its Application to Phylogenetic Inference
    Kassian Kobert, Tomáš Flouri, Andre Aberer, Alexandros Stamatakis
    Pages 204-216
  15. Multiple Mass Spectrometry Fragmentation Trees Revisited: Boosting Performance and Quality
    Kerstin Scheubert, Franziska Hufsky, Sebastian Böcker
    Pages 217-231
  16. An Online Peak Extraction Algorithm for Ion Mobility Spectrometry Data
    Dominik Kopczynski, Sven Rahmann
    Pages 232-246
  17. Best-Fit in Linear Time for Non-generative Population Simulation
    Niina Haiminen, Claude Lebreton, Laxmi Parida
    Pages 247-262

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 14th International Workshop on Algorithms in Bioinformatics, WABI 2014, held in Wroclaw, Poland, in September 2014. WABI 2014 was one of seven conferences that were organized as part of ALGO 2014. WABI is an annual conference series on all aspects of algorithms and data structure in molecular biology, genomics and phylogeny data analysis. The 26 full papers presented together with a short abstract were carefully reviewed and selected from 61 submissions. The selected papers cover a wide range of topics from sequence and genome analysis through phylogeny reconstruction and networks to mass spectrometry data analysis.

Keywords

bioinformatics complexity computational genomics data mining data structures design and analysis of algorithms discrete mathematics evolutionary dynamics genome assembly genomic sequences graph theory

Editors and affiliations

  • Dan Brown
    • 1
  • Burkhard Morgenstern
    • 2
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooCanada
  2. 2.Institute of Microbiology and Genetics, Department of BioinformaticsUniversity of Göttingen, GermanyGöttingenGermany

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2014
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-44752-9
  • Online ISBN 978-3-662-44753-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349