LEADER 05763nam 22008415 450 001 9910483018603321 005 20251226203500.0 010 $a3-540-87361-9 024 7 $a10.1007/978-3-540-87361-7 035 $a(CKB)1000000000490305 035 $a(SSID)ssj0000316190 035 $a(PQKBManifestationID)11247780 035 $a(PQKBTitleCode)TC0000316190 035 $a(PQKBWorkID)10281764 035 $a(PQKB)10273644 035 $a(DE-He213)978-3-540-87361-7 035 $a(MiAaPQ)EBC3063457 035 $a(MiAaPQ)EBC6413362 035 $a(PPN)129062804 035 $a(EXLCZ)991000000000490305 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms in Bioinformatics $e8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008, Proceedings /$fedited by Keith Crandall, Jens Lagergren 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 396 p.) 225 1 $aLecture Notes in Bioinformatics,$x2366-6331 ;$v5251 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-87360-0 320 $aIncludes bibliographical references and index. 327 $aMultichromosomal Genome Median and Halving Problems -- A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem -- Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem -- Read Mapping Algorithms for Single Molecule Sequencing Data -- Exact Transcriptome Reconstruction from Short Sequence Reads -- Post-Hybridization Quality Measures for Oligos in Genome-Wide Microarray Experiments -- NAPX: A Polynomial Time Approximation Scheme for the Noah?s Ark Problem -- Minimum Common String Partition Parameterized -- Hardness and Approximability of the Inverse Scope Problem -- Rapid Neighbour-Joining -- Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices -- Efficient Genome Wide Tagging by Reduction to SAT -- Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming -- An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem -- A Faster Algorithm for RNA Co-folding -- An Automated Combination of Kernels for Predicting Protein Subcellular Localization -- Fast Target Set Reduction for Large-Scale Protein Function Prediction: A Multi-class Multi-label Machine Learning Approach -- Multiple Instance Learning Allows MHC Class II Epitope Predictions Across Alleles -- An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks -- Enumerating Precursor Sets of Target Metabolites in a Metabolic Network -- Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach -- Fast Bayesian Haplotype Inference Via Context Tree Weighting -- Genotype Sequence Segmentation: Handling Constraints and Noise -- Constructing Phylogenetic Supernetworks from Quartets -- Summarizing Multiple Gene TreesUsing Cluster Networks -- Fast and Adaptive Variable Order Markov Chain Construction -- Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata -- The Relation between Indel Length and Functional Divergence: A Formal Study -- Detecting Repeat Families in Incompletely Sequenced Genomes -- Novel Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden Markov Models -- A Local Move Set for Protein Folding in Triangular Lattice Models -- Protein Decoy Generation Using Branch and Bound with Efficient Bounding. 330 $aThis book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting. The 32 revised full papers presented together with the abstract of a keynote talk were carefully reviewed and selected from 81 submissions. All current issues of algorithms in bioinformatics are addressed, reaching from mathematical tools to experimental studies of approximation algorithms and reports on significant computational analyses. The topics range in biological applicability from genome mapping, to sequence assembly, to microarray quality, to phylogenetic inference, to molecular modeling. 410 0$aLecture Notes in Bioinformatics,$x2366-6331 ;$v5251 606 $aAlgorithms 606 $aBiochemistry 606 $aComputer programming 606 $aComputer science 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aBiochemistry 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aBiochemistry. 615 0$aComputer programming. 615 0$aComputer science. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aBiochemistry. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 676 $a572.80285 702 $aCrandall$b Keith 702 $aLagergren$b Jens 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483018603321 996 $aAlgorithms in Bioinformatics$9772095 997 $aUNINA