default search action
8. WABI 2008: Karlsruhe, Germany
- Keith A. Crandall
, Jens Lagergren:
Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings. Lecture Notes in Computer Science 5251, Springer 2008, ISBN 978-3-540-87360-0 - Eric Tannier, Chunfang Zheng, David Sankoff:
Multichromosomal Genome Median and Halving Problems. 1-13 - Meng Zhang, William Arndt, Jijun Tang:
A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem. 14-24 - Andrew Wei Xu, David Sankoff:
Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem. 25-37 - Vladimir Yanovski, Stephen M. Rumble, Michael Brudno:
Read Mapping Algorithms for Single Molecule Sequencing Data. 38-49 - Vincent Lacroix, Michael Sammeth, Roderic Guigó, Anne Bergeron:
Exact Transcriptome Reconstruction from Short Sequence Reads. 50-63 - Florian Battke
Post-Hybridization Quality Measures for Oligos in Genome-Wide Microarray Experiments. 64-75 - Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. 76-86 - Peter Damaschke:
Minimum Common String Partition Parameterized. 87-98 - Zoran Nikoloski
Hardness and Approximability of the Inverse Scope Problem. 99-112 - Martin Simonsen, Thomas Mailund
Rapid Neighbour-Joining. 113-122 - Seung-Jin Sul, Grant R. Brammer, Tiffani L. Williams:
Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices. 123-134 - Arthur Choi, Noah Zaitlen, Buhm Han, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin:
Efficient Genome Wide Tagging by Reduction to SAT. 135-147 - Serdar Bozdag, Timothy J. Close, Stefano Lonardi
Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming. 148-161 - Rumen Andonov, Nicola Yanev, Noël Malod-Dognin
An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem. 162-173 - Michal Ziv-Ukelson, Irit Gat-Viks, Ydo Wexler, Ron Shamir
A Faster Algorithm for RNA Co-folding. 174-185 - Cheng Soon Ong, Alexander Zien:
An Automated Combination of Kernels for Predicting Protein Subcellular Localization. 186-197 - Thomas Lingner, Peter Meinicke:
Fast Target Set Reduction for Large-Scale Protein Function Prediction: A Multi-class Multi-label Machine Learning Approach. 198-209 - Nico Pfeifer, Oliver Kohlbacher
Multiple Instance Learning Allows MHC Class II Epitope Predictions Across Alleles. 210-221 - Alexander Medvedovsky, Vineet Bafna
An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks. 222-232 - Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela
Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. 233-244 - Xiuwei Zhang, Bernard M. E. Moret
Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach. 245-258 - Pasi Rastas, Jussi Kollin, Mikko Koivisto:
Fast Bayesian Haplotype Inference Via Context Tree Weighting. 259-270 - Qi Zhang, Wei Wang
Genotype Sequence Segmentation: Handling Constraints and Noise. 271-283 - Stefan Grünewald, Andreas Spillner, Kristoffer Forslund
Constructing Phylogenetic Supernetworks from Quartets. 284-295 - Daniel H. Huson, Regula Rupp:
Summarizing Multiple Gene Trees Using Cluster Networks. 296-305 - Marcel H. Schulz
Fast and Adaptive Variable Order Markov Chain Construction. 306-317 - Inke Herms, Sven Rahmann:
Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata. 318-329 - Raheleh Salari, Alexander Schönhuth, Fereydoun Hormozdiari, Artem Cherkasov, Süleyman Cenk Sahinalp:
The Relation between Indel Length and Functional Divergence: A Formal Study. 330-341 - José Augusto Amgarten Quitzau, Jens Stoye
Detecting Repeat Families in Incompletely Sequenced Genomes. 342-353 - Sagi Snir, Tamir Tuller:
Novel Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden Markov Models. 354-368 - Hans-Joachim Böckenhauer
A Local Move Set for Protein Folding in Triangular Lattice Models. 369-381 - Martin Paluszewski, Pawel Winter
Protein Decoy Generation Using Branch and Bound with Efficient Bounding. 382-393
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-17 21:04 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: