default search action
14. WABI 2014: Wroclaw, Poland
- Dan Brown, Burkhard Morgenstern:
Algorithms in Bioinformatics - 14th International Workshop, WABI 2014, Wroclaw, Poland, September 8-10, 2014. Proceedings. Lecture Notes in Computer Science 8701, Springer 2014, ISBN 978-3-662-44752-9 - Matteo Comin, Andrea Leoni, Michele Schimd:
QCluster: Extending Alignment-Free Measures with Quality Values for Reads Clustering. 1-13 - Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. 14-25 - Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions. 26-37 - Phillip E. C. Compeau:
A Generalized Cost Model for DCJ-Indel Sorting. 38-51 - Gene Myers:
Efficient Local Alignment Discovery amongst Noisy Long Reads. 52-67 - Martin D. Muggli, Simon J. Puglisi, Christina Boucher:
Efficient Indexed Alignment of Contigs to Optical Maps. 68-81 - Gustavo Sacomoto, Blerina Sinaimeri, Camille Marchet, Vincent Miele, Marie-France Sagot, Vincent Lacroix:
Navigating in a Sea of Repeats in RNA-seq without Drowning. 82-96 - Shuai Jiang, Max A. Alekseyev:
Linearization of Median Genomes under DCJ. 97-106 - Yu-Ting Huang, Marek Chrobak:
An LP-Rounding Algorithm for Degenerate Primer Design. 107-121 - Vladimír Boza, Brona Brejová, Tomás Vinar:
GAML: Genome Assembly by Maximum Likelihood. 122-134 - Sebastian Will, Peter F. Stadler:
A Common Framework for Linear and Cyclic Multiple Sequence Alignment Problems. 135-147 - Laxmi Parida, Cinzia Pizzi, Simona E. Rombo:
Entropic Profiles, Maximal Motifs and the Discovery of Significant Repetitions in Genomic Sequences. 148-160 - Burkhard Morgenstern, Binyao Zhu, Sebastian Horwege, Chris-André Leimeister:
Estimating Evolutionary Distances from Spaced-Word Matches. 161-173 - Fábio Viduani Martinez, Pedro Feijão, Marília D. V. Braga, Jens Stoye:
On the Family-Free DCJ Distance. 174-186 - Constantinos Tsirogiannis, Brody Sandel, Adrija Kalvisa:
New Algorithms for Computing Phylogenetic Biodiversity. 187-203 - Kassian Kobert, Tomás Flouri, Andre J. Aberer, Alexandros Stamatakis:
The Divisible Load Balance Problem and Its Application to Phylogenetic Inference. 204-216 - Kerstin Scheubert, Franziska Hufsky, Sebastian Böcker:
Multiple Mass Spectrometry Fragmentation Trees Revisited: Boosting Performance and Quality. 217-231 - Dominik Kopczynski, Sven Rahmann:
An Online Peak Extraction Algorithm for Ion Mobility Spectrometry Data. 232-246 - Niina Haiminen, Claude Lebreton, Laxmi Parida:
Best-Fit in Linear Time for Non-generative Population Simulation - (Extended Abstract). 247-262 - Ei-Wen Yang, Tao Jiang:
GDNorm: An Improved Poisson Regression Model for Reducing Biases in Hi-C Data. 263-280 - Sagi Snir:
Pacemaker Partition Identification. 281-295 - Yu Lin, Pavel A. Pevzner:
Manifold de Bruijn Graphs. 296-310 - Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, Raffaella Rizzi:
Constructing String Graphs in External Memory. 311-325 - Chen Gu, Leonidas J. Guibas, Michael Kerber:
Topology-Driven Trajectory Synthesis with an Example on Retinal Cell Motions. 326-339 - Sharon Bruckner, Falk Hüffner, Christian Komusiewicz:
A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks. 340-351 - Adrin Jalali, Nico Pfeifer:
Interpretable Per Case Weighted Ensemble Method for Cancer Associations. 352-353 - Iman Hajirasouliha, Benjamin J. Raphael:
Reconstructing Mutational History in Multiply Sampled Tumors Using Perfect Phylogeny Mixtures. 354-367
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.