default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10. WABI 2010: Liverpool, UK
- Vincent Moulton, Mona Singh:
Algorithms in Bioinformatics, 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings. Lecture Notes in Computer Science 6293, Springer 2010, ISBN 978-3-642-15293-1
Biomolecular Structure: RNA, Protein and Molecular Comparison
- Yelena Frid, Dan Gusfield:
A Worst-Case and Practical Speedup for the RNA Co-folding Problem Using the Four-Russians Idea. 1-12 - Raghavendra Hosur, Rohit Singh
, Bonnie Berger:
Sparse Estimation for Structural Variability. 13-27 - Thomas Greve Kristensen, Christian N. S. Pedersen:
Data Structures for Accelerating Tanimoto Queries on Real Valued Vectors. 28-39 - Mathias Möhl, Raheleh Salari, Sebastian Will, Rolf Backofen, Süleyman Cenk Sahinalp:
Sparsification of RNA Structure Prediction Including Pseudoknots. 40-51 - Corinna Theis, Stefan Janssen, Robert Giegerich:
Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs. 52-64 - Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson:
Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. 65-77
Comparative Genomics
- Denis Bertrand, Yves Gagnon, Mathieu Blanchette, Nadia El-Mabrouk:
Reconstruction of Ancestral Genome Subject to Whole Genome Duplication, Speciation, Rearrangement and Loss. 78-89 - Marília D. V. Braga, Eyla Willing, Jens Stoye:
Genomic Distance with DCJ and Indels. 90-101 - Krister M. Swenson, Ghada Badr, David Sankoff:
Listing All Sorting Reversals in Quadratic Time. 102-110
Haplotype and Genotype Analysis
- Daniel G. Brown, Tanya Y. Berger-Wolf:
Discovering Kinship through Small Subsets. 111-123 - Duong Dai Doan, Patricia A. Evans:
Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites. 124-135 - Bonnie Kirkpatrick:
Haplotypes versus Genotypes on Pedigrees. 136-147 - Yuri Pirola, Paola Bonizzoni, Tao Jiang:
Haplotype Inference on Pedigrees with Recombinations and Mutations. 148-161
High-throughput Data Analysis: Next Generation Sequencing and Flow Cytometry
- Ariful Azad, Johannes Langguth, Youhan Fang, Yuan (Alan) Qi, Alex Pothen:
Identifying Rare Cell Populations in Comparative Flow Cytometry. 162-175 - Miklós Csürös, Szilveszter Juhos, Attila Bérces:
Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA. 176-188 - Arun Siddharth Konagurthu, Lloyd Allison, Thomas C. Conway, Bryan Beresford-Smith, Justin Zobel:
Design of an Efficient Out-of-Core Read Alignment Algorithm. 189-201 - Marius Nicolae, Serghei Mangul, Ion I. Mandoiu, Alexander Zelikovsky:
Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data. 202-214
Networks
- Iftah Gamzu, Danny Segev, Roded Sharan:
Improved Orientations of Physical Networks. 215-225 - Paulo Vieira Milreu, Vicente Acuña, Etienne Birmelé, Pierluigi Crescenzi, Alberto Marchetti-Spaccamela, Marie-France Sagot, Leen Stougie, Vincent Lacroix:
Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. 226-237 - Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva:
Efficient Subgraph Frequency Estimation with G-Tries. 238-249
Phylogenetics
- Magnus Bordewich, Radu Mihaescu:
Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. 250-261 - Jesper Jansson, Richard S. Lemence, Andrzej Lingas:
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. 262-273 - Kristian Stevens, Dan Gusfield:
Reducing Multi-state to Binary Perfect Phylogeny with Applications to Missing, Removable, Inserted, and Deleted Data. 274-287 - M. Shel Swenson, Rahul Suri, C. Randal Linder, Tandy J. Warnow:
An Experimental Study of Quartets MaxCut and Other Supertree Methods. 288-299 - Louxin Zhang, Yun Cui:
An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation. 300-311
Sequences, Strings and Motifs
- Dan He, Eleazar Eskin:
Effective Algorithms for Fusion Gene Detection. 312-324 - Franziska Hufsky, Léon Kuchenbecker, Katharina Jahn, Jens Stoye, Sebastian Böcker:
Swiftly Computing Center Strings. 325-336 - Tobias Marschall, Sven Rahmann:
Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size. 337-349 - Alexander Schönhuth, Raheleh Salari, Süleyman Cenk Sahinalp:
Pair HMM Based Gap Statistics for Re-evaluation of Indels in Alignments with Affine Gap Penalties. 350-361 - Chen-Hsiang Yeang:
Quantifying the Strength of Natural Selection of a Motif Sequence. 362-373
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-10-17 00:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
