LEADER 05804nam 22007695 450 001 9910768455703321 005 20200701203504.0 010 $a3-540-39763-9 024 7 $a10.1007/b13243 035 $a(CKB)1000000000212175 035 $a(SSID)ssj0000321226 035 $a(PQKBManifestationID)11937821 035 $a(PQKBTitleCode)TC0000321226 035 $a(PQKBWorkID)10263724 035 $a(PQKB)11161899 035 $a(DE-He213)978-3-540-39763-2 035 $a(MiAaPQ)EBC3088193 035 $a(PPN)15518508X 035 $a(EXLCZ)991000000000212175 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms in Bioinformatics $eThird International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings /$fedited by Gary Benson, Roderic Page 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (X, 534 p.) 225 1 $aLecture Notes in Bioinformatics ;$v2812 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20076-2 320 $aIncludes bibliographical references and index. 327 $aComparative Genomics -- A Local Chaining Algorithm and Its Applications in Comparative Genomics -- Common Intervals of Two Sequences -- A Systematic Statistical Analysis of Ion Trap Tandem Mass Spectra in View of Peptide Scoring -- Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity -- Gene Finding and Expression -- A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods -- A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence -- Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency -- Genome Mapping -- New Algorithm for the Simplified Partial Digest Problem -- Noisy Data Make the Partial Digest Problem NP-hard -- Pattern and Motif Discovery -- Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions -- A Combinatorial Approach to Automatic Discovery of Cluster-Patterns -- Dynamic Programming Algorithms for Two Statistical Problems in Computational Biology -- Phylogenetic Analysis -- Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees -- Efficient Generation of Uniform Samples from Phylogenetic Trees -- New Efficient Algorithm for Detection of Horizontal Gene Transfer Events -- Ancestral Maximum Likelihood of Evolutionary Trees Is Hard -- A Linear-Time Majority Tree Algorithm -- Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model -- Better Hill-Climbing Searches for Parsimony -- Computing Refined Buneman Trees in Cubic Time -- Distance Corrections on Recombinant Sequences -- Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks -- Polymorphism -- Identifying Blocks and Sub-populations in Noisy SNP Data -- Designing Optimally Multiplexed SNP Genotyping Assays -- Minimum Recombinant Haplotype Configuration on Tree Pedigrees -- Protein Structure -- Efficient Energy Computation for Monte Carlo Simulation of Proteins -- Speedup LP Approach to Protein Threading via Graph Reduction -- Homology Modeling of Proteins Using Multiple Models and Consensus Sequence Alignment -- Side-Chain Structure Prediction Based on Dead-End Elimination: Single Split DEE-criterion Implementation and Elimination Power -- Sequence Alignment -- A Large Version of the Small Parsimony Problem -- Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree -- Composition Alignment -- String Algorithms -- Match Chaining Algorithms for cDNA Mapping -- Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt -- Bounds for Resequencing by Hybridization -- Selecting Degenerate Multiplex PCR Primers. 410 0$aLecture Notes in Bioinformatics ;$v2812 606 $aLife sciences 606 $aComputer programming 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputers 606 $aComputer science?Mathematics 606 $aLife Sciences, general$3https://scigraph.springernature.com/ontologies/product-market-codes/L00004 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 615 0$aLife sciences. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputers. 615 0$aComputer science?Mathematics. 615 14$aLife Sciences, general. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aComputation by Abstract Devices. 615 24$aMathematics of Computing. 676 $a572.8/0285 702 $aBenson$b Gary$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPage$b Roderic$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWABI (Workshop) 906 $aBOOK 912 $a9910768455703321 996 $aAlgorithms in Bioinformatics$9772095 997 $aUNINA