10th Workshop on Algorithms in Bioinformatics

6th - 8th September 2010
University of Liverpool, United Kingdom

Accepted Papers

  1. [2] Bonnie Kirkpatrick. “Haplotypes versus Genotypes on Pedigrees
  2. [7] Marilia Braga, Eyla Willing and Jens Stoye. “Genomic distance with DCJ and indels
  3. [9] Corinna Theis, Stefan Janssen and Robert Giegerich. “Prediction of RNA secondary structure including kissing hairpin motifs
  4. [11] Louxin Zhang and Yun Cui. “An Efficient Method for DNA-based Species Assignment via Gene Tree and Species Tree Reconciliation
  5. [12] Iftah Gamzu, Danny Segev and Roded Sharan. “Improved Orientations of Physical Networks
  6. [15] Thomas Greve Kristensen and Christian Nørgaard Storm Pedersen. “Data structures for accelerating Tanimoto queries on real valued vectors
  7. [16] Paulo Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie and Vincent Lacroix. “Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms
  8. [21] Tobias Marschall and Sven Rahmann. “Speeding up Exact Motif Discovery by Bounding the Expected Clump Size
  9. [25] Dekel Tsur, Shay Zakov and Michal Ziv-Ukelson. “Reducing the Worst Case Running Time of a Family of RNA and CFG Problems, Using Valiant's Approach
  10. [27] Jesper Jansson, Richard S. Lemence and Andrzej Lingas. “The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
  11. [29] Arun Konagurthu, Lloyd Allison, Thomas Conway, Bryan Beresford-Smith and Justin Zobel. “Design of an Efficient Out-of-Core Read Alignment Algorithm
  12. [30] Franziska Hufsky, Léon Kuchenbecker, Katharina Jahn, Jens Stoye and Sebastian Böcker. “Swiftly computing center strings
  13. [34] Yuri Pirola and Tao Jiang. “Haplotype Inference on Pedigrees with Recombinations and Mutations
  14. [38] Chen-Hsiang Yeang. “Quantifying the strength of natural selection of a motif sequence
  15. [39] Kristian Stevens and Dan Gusfield. “Reducing Multi-State to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data
  16. [43] Magnus Bordewich and Radu Mihaescu. “Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution
  17. [46] Miklos Csuros, Szilveszter Juhos and Attila Berces. “Fast mapping and precise alignment of AB SOLiD color reads to reference DNA
  18. [59] Duong Doan and Patricia Evans. “Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites
  19. [61] Dan He and Eleazar Eskin. “Effective Algorithms for Fusion Gene Detection
  20. [66] Daniel Brown and Tanya Berger-Wolf. “Discovering kinship through small subsets
  21. [68] Marius Nicolae, Serghei Mangul, Ion Mandoiu and Alex Zelikovsky. “Estimation of alternative splicing isoform frequencies from RNA-Seq data
  22. [70] M. Shel Swenson, Rahul Suri, Randy Linder and Tandy Warnow. “An Experimental Study of Quartets MaxCut and Other Supertree Methods
  23. [72] Krister Swenson, Ghada Badr and David Sankoff. “Listing All Sorting Reversals in Quadratic Time
  24. [73] Mathias Mohl, Raheleh Salari, Sebastian Will, Rolf Backofen and S. Cenk Sahinalp. “Sparsification of RNA Structure Prediction Including Pseudoknots
  25. [74] Ariful Azad, Johannes Langguth, Youhan Fang, Alan Qi and Alex Pothen. “Identification of Rare Cell Populations in Comparative Flow Cytometry
  26. [75] Alexander Schoenhuth, Raheleh Salari and S. Cenk Sahinalp. “Pair HMM based gap statistics for re-evaluation of indels in alignments with affine gap penalties
  27. [77] Raghavendra Hosur, Rohit Singh and Bonnie Berger. “Sparse Estimation For Structural Variability
  28. [80] Denis Bertrand, Yves Gagnon, Mathieu Blanchette and Nadia El-Mabrouk. “Reconstruction of Ancestral Genome subject to Whole Genome Duplication, Speciation, Rearrangement and Loss
  29. [82] Pedro Ribeiro and Fernando Silva. “Efficient Subgraph Frequency Estimation with G-Tries
  30. [86] Yelena Frid and Dan Gusfield. “A worst-case and practical speedup for the RNA co-folding problem using the Four-Russians idea