List of accepted papers

  • Kouichi Kimura, Asako Koike and Kenta Nakai. Seed-Set Construction by Equi-Entropy Partitioning for Efficient and Sensitive Short-Read Mapping
  • Jouni Sirén, Niko Välimäki and Veli Mäkinen. Indexing Finite Language Representation of Population Genotypes
  • Yu Lin, Vaibhav Rajan and Bernard Moret. Bootstrapping Phylogenies Inferred from Rearrangement Data
  • Elad Donsky and Haim J. Wolfson. PepCrawler: A Fast RRT-like Algorithm for High-Resolution Refinement and Binding-Affinity Estimation of Peptide Inhibitors
  • Jianrong Dong and David Fernández-Baca. Constructing Large Conservative Supertrees
  • Olga Tanaseichuk, James Borneman and Tao Jiang. Separating Metagenomic Data into Genomes via Clustering
  • Rayan Chikhi and Dominique Lavenier. Localized genome assembly from reads to scaffolds: practical traversal of the paired string graph
  • Bronislava Brejova, Michal Burger and Tomas Vinar. Automated Segmentation of DNA Sequences with  Complex Evolutionary History
  • Jakub Kovac, Bronislava Brejova and Tomas Vinar. A Practical Algorithm for Ancestral Rearrangement Reconstruction
  • Andrea Doroftei and Nadia El-Mabrouk. Removing noise from gene trees
  • Daniel Doerr, Ilan Gronau, Shlomo Moran and Irad Yavneh. Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions
  • Yann Ponty and Cedric Saule. A combinatorial framework for the design of (pseudoknotted) RNA algorithms
  • Hang Xiao, Melvin Zhang, Axel Mosig and Hon Wai Leong. Dynamic Programming Algorithms for Efficiently Computing Cosegmentations between Biological Images
  • Chunfang Zheng, Krister Swenson, Eric Lyons and David Sankoff. OMG! Orthologs in Multiple Genomes - Competing Graph-Theoretical Formulations
  • Md Mahmud and Alexander Schliep. Speeding Up Bayesian HMM by the Four Russians Method
  • Vincent Noel, Sergei Vakulenko and Ovidiu Radulescu. Algorithm for identification of piecewise smooth hybrid systems; application to eukaryotic cell cycle regulation
  • Michel Habib and Thu-Hien To. On a conjecture about compatibility of multi-states characters
  • Mohamed Elati, Ivan Junier and François Képès. Boosting binding sites prediction using gene's positions
  • Andrew Wei Xu and Bernard Moret. GASTS: Parsimony Scoring under Rearrangements
  • Daniel Brown and Jakub Truszkowski. Towards a practical O( n log n) phylogeny algorithm
  • Hans-Michael Kaltenbach, Simona Constantinescu, Justin Feigelman and Joerg Stelling. Graph-based decomposition of biochemical reaction networks into monotone subsystems
  • Noel Malod-Dognin, Mathilde Le Boudic-Jamin, Pritish Kamath and Rumen Andonov. Using Dominances for Solving the Protein Family Identification Problem
  • Qiang Jiang. Learning Protein Functions From Bi-relational Graph of proteins and function annotations
  • Serghei Mangul, Irina Astrovskaya, Marius Nicolae, Bassam Tork, Ion Mandoiu and Alex Zelikovsky. Maximum Likelihood Estimation of Incomplete Genomic Spectrum from HTS Data
  • Kristian Stevens and Bonnie Kirkpatrick. Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing Values
  • Fabio Vandin, Eli Upfal and Ben Raphael. Finding Driver Pathways in Cancer: Models and Algorithms
  • Rob Patro, Emre Sefer, Justin Malin, Guillaume Marcais, Saket Navlakha and Carl Kingsford. Parsimonious Reconstruction of Network Evolution
  • Joseph Whitney, Judice Koh, Michael Costanzo, Grant Brown, Charles Boone and Michael Brudno. Clustering with Overlap for Genetic Interaction Networks via Local Search Optimization
  • Rob Gysel, Fumei Lam and Dan Gusfield. Constructing Perfect Phylogenies and Proper Triangulations for Three-State Characters
  • Stefan Canzar and Mohammed El-Kebir. A Mathematical Programming Approach to Marker-Assisted Gene Pyramiding