default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. WABI 2012: Ljubljana, Slovenia
- Benjamin J. Raphael, Jijun Tang:
Algorithms in Bioinformatics - 12th International Workshop, WABI 2012, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Lecture Notes in Computer Science 7534, Springer 2012, ISBN 978-3-642-33121-3 - Matthias Bernt
, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier:
Preserving Inversion Phylogeny Reconstruction. 1-13 - Daniel Gregory Brown, Jakub Truszkowski:
Fast Phylogenetic Tree Reconstruction Using Locality-Sensitive Hashing. 14-29 - Constantinos Tsirogiannis, Brody Sandel, Dimitris Cheliotis:
Efficient Computation of Popular Phylogenetic Tree Measures. 30-43 - Daniel Gregory Brown, Daniel Dexter:
SibJoin: A Fast Heuristic for Half-Sibling Reconstruction. 44-56 - Yun Zhu, Luay Nakhleh:
Reconstructing the Evolution of Molecular Interaction Networks under the DMC and Link Dynamics Models. 57-68 - Bjarni V. Halldórsson, Dima Blokh, Roded Sharan:
Estimating Population Size via Line Graph Reconstruction. 69-80 - Akshay Deepak, David Fernández-Baca, Michelle M. McMahon:
Extracting Conflict-Free Information from Multi-labeled Trees. 81-92 - Rob Gysel, Kristian Stevens, Dan Gusfield:
Reducing Problems in Unrooted Tree Compatibility to Restricted Triangulations of Intersection Graphs. 93-105 - Manuel Lafond, Krister M. Swenson, Nadia El-Mabrouk:
An Optimal Reconciliation Algorithm for Gene Trees with Polytomies. 106-122 - Thi Hau Nguyen, Jean-Philippe Doyon, Stéphanie Pointet, Anne-Muriel Arigon Chifolleau, Vincent Ranwez, Vincent Berry:
Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference. 123-134 - Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson:
RNA Tree Comparisons via Unrooted Unordered Alignments. 135-148 - Philippe Rinaudo, Yann Ponty, Dominique Barth, Alain Denise:
Tree Decomposition and Parameterized Algorithms for RNA Structure-Sequence Alignment Including Tertiary Interactions and Pseudoknots - (Extended Abstract). 149-164 - Anirban Bhar, Martin Haubrock, Anirban Mukhopadhyay, Ujjwal Maulik, Sanghamitra Bandyopadhyay, Edgar Wingender:
δ-TRIMAX: Extracting Triclusters and Analysing Coregulation in Time Series Gene Expression Data. 165-177 - Yen-Yi Lin, Phuong Dao, Faraz Hach, Marzieh Bakhshi, Fan Mo, Anna Lapuk, Colin C. Collins, Süleyman Cenk Sahinalp:
CLIIQ: Accurate Comparative Detection and Quantification of Expressed Isoforms in a Population. 178-189 - Brad Shutters, Sudheer Vakati, David Fernández-Baca:
Improved Lower Bounds on the Compatibility of Quartets, Triplets, and Multi-state Characters. 190-200 - Yasuo Tabei:
Succinct Multibit Tree: Compact Representation of Multibit Trees by Using Succinct Data Structures in Chemical Fingerprint Searches. 201-213 - Anthony J. Cox, Tobias Jakobi, Giovanna Rosone, Ole Schulz-Trieglaff:
Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes. 214-224 - Alexander Bowe, Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya:
Succinct de Bruijn Graphs. 225-235 - Rayan Chikhi, Guillaume Rizk:
Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter. 236-248 - Nikolay Vyahhi, Alex Pyshkin, Son K. Pham, Pavel A. Pevzner:
From de Bruijn Graphs to Rectangle Graphs for Genome Assembly. 249-261 - Natalie Castellana, Andrey Lushnikov, Piotr Rotkiewicz, Natasha Sefcovic, Pavel A. Pevzner, Adam Godzik, Kira Vyatkina:
MORPH-PRO: A Novel Algorithm and Web Server for Protein Morphing. 262-273 - Xuefeng Cui, Shuai Cheng Li, Dongbo Bu, Babak Alipanahi Ramandi, Ming Li:
How Accurately Can We Model Protein Structures with Dihedral Angles? 274-287 - Geet Duggal, Rob Patro, Emre Sefer, Hao Wang, Darya Filippova, Samir Khuller, Carl Kingsford:
Resolving Spatial Inconsistencies in Chromosome Conformation Data. 288-300 - Hosein Mohimani, Sangtae Kim, Pavel A. Pevzner:
MS-DPR: An Algorithm for Computing Statistical Significance of Spectral Identifications of Non-linear Peptides. 301-313 - Song Gao, Denis Bertrand, Niranjan Nagarajan:
FinIS: Improved in silico Finishing Using an Exact Quadratic Programming Formulation. 314-325 - Markus J. Bauer, Anthony J. Cox, Giovanna Rosone, Marinella Sciortino:
Lightweight LCP Construction for Next-Generation Sequencing Datasets. 326-337 - Shay Houri, Roded Sharan:
Sign Assignment Problems on Protein Networks. 338-345 - Yi Shi, Xiaoping Liao, Xinhua Zhang, Guohui Lin, Dale Schuurmans:
Sparse Learning Based Linear Coherent Bi-clustering. 346-364 - Phillip E. C. Compeau:
A Simplified View of DCJ-Indel Distance. 365-377 - Poly H. da Silva, Marília D. V. Braga, Raphael Machado, Simone Dantas:
DCJ-indel Distance with Distinct Operation Costs. 378-390 - Birte Kehr, Knut Reinert, Aaron E. Darling:
Hidden Breakpoints in Genome Alignments. 391-403 - Olga Tanaseichuk, James Borneman, Tao Jiang:
A Probabilistic Approach to Accurate Abundance-Based Binning of Metagenomic Reads. 404-416 - Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré:
Tandem Halving Problems by DCJ. 417-429 - Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca:
A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number. 430-440 - Niko Välimäki, Simon J. Puglisi:
Distributed String Mining for High-Throughput Sequencing Data. 441-452
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 2024-11-08 20:17 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
