default search action
13. WABI 2013: Sophia Antipolis, France
- Aaron E. Darling, Jens Stoye
:
Algorithms in Bioinformatics - 13th International Workshop, WABI 2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Lecture Notes in Computer Science 8126, Springer 2013, ISBN 978-3-642-40452-8 - Bernard M. E. Moret
Extending the Reach of Phylogenetic Inference. 1-2 - Ramanuja Simha
Protein (Multi-)Location Prediction: Using Location Inter-dependencies in a Probabilistic Framework. 3-17 - Xuefeng Cui, Shuai Cheng Li
Towards Reliable Automatic Protein Structure Alignment. 18-32 - Arnon Mazza, Irit Gat-Viks, Hesso Farhan
A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions. 33-44 - Kai Dührkop
Faster Mass Decomposition. 45-58 - Evgeny Kapun, Fedor Tsarev:
On NP-Hardness of the Paired de Bruijn Sound Cycle Problem. 59-69 - Denisa Duma, Mary Wootters, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, Matthew Alpert, Timothy J. Close, Gianfranco Ciardo, Stefano Lonardi
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. 70-84 - Alexandru I. Tomescu
A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths. 85-98 - Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot:
A Polynomial Delay Algorithm for the Enumeration of Bubbles with Length Constraints in Directed Graphs and Its Application to the Detection of Alternative Splicing in RNA-seq Data. 99-111 - Rolf Backofen, Markus Fricke, Manja Marz, Jing Qin
Distribution of Graph-Distances in Boltzmann Ensembles of RNA Secondary Structures. 112-125 - Balaji Venkatachalam, Dan Gusfield, Yelena Frid:
Faster Algorithms for RNA-Folding Using the Four-Russians Method. 126-140 - Jesper Jansson
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree. 141-155 - Sebastian Böcker
The Generalized Robinson-Foulds Metric. 156-169 - Constantinos Tsirogiannis, Brody Sandel:
Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time. 170-184 - Sudheer Vakati, David Fernández-Baca:
Characterizing Compatibility and Agreement of Unrooted Trees via Cuts in Graphs. 185-199 - Nicolas Wieseke, Matthias Bernt
Unifying Parsimonious Tree Reconciliation. 200-214 - Ilya Minkin, Anand Patel, Mikhail Kolmogorov, Nikolay Vyahhi, Son K. Pham:
Sibelia: A Scalable and Comprehensive Synteny Block Generation Tool for Closely Related Microbial Genomes. 215-229 - João Paulo Pereira Zanetti, Priscila Biller, João Meidanis:
On the Matrix Median Problem. 230-243 - Laurent Bulteau
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. 244-258 - Michal Modzelewski, Norbert Dojer:
MSARC: Multiple Sequence Alignment by Residue Clustering. 259-272 - Limor Leibovich, Zohar Yakhini:
Mutual Enrichment in Ranked Lists and the Statistical Assessment of Position Weight Matrix Motifs. 273-286 - Michal Nánási, Tomás Vinar
Probabilistic Approaches to Alignment with Tandem Repeats. 287-299 - Darya Filippova, Rob Patro, Geet Duggal, Carl Kingsford:
Multiscale Identification of Topological Domains in Chromatin. 300-312 - Charalampos E. Tsourakakis:
Modeling Intratumor Gene Copy Number Heterogeneity Using Fluorescence in Situ Hybridization Data. 313-325 - Nishanth Ulhas Nair
Phylogenetic Analysis of Cell Types Using Histone Modifications. 326-337 - Taku Onodera, Kunihiko Sadakane
Detecting Superbubbles in Assembly Graphs. 338-348 - Viraj Deshpande, Eric D. K. Fung, Son Pham, Vineet Bafna
Cerulean: A Hybrid Assembly Using High Throughput Short and Long Reads. 349-363 - Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs. 364-376
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-12-19 22:18 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: