LEADER 06768nam 22008415 450 001 9910482997403321 005 20251226202833.0 024 7 $a10.1007/11557067 035 $a(CKB)1000000000213261 035 $a(SSID)ssj0000316192 035 $a(PQKBManifestationID)11242658 035 $a(PQKBTitleCode)TC0000316192 035 $a(PQKBWorkID)10275341 035 $a(PQKB)11739045 035 $a(DE-He213)978-3-540-31812-5 035 $a(MiAaPQ)EBC3067835 035 $a(PPN)123097614 035 $a(BIP)12717128 035 $a(EXLCZ)991000000000213261 100 $a20100316d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms in Bioinformatics $e5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings /$fedited by Rita Casadio, Gene Myers 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (X, 436 p.) 225 1 $aLecture Notes in Bioinformatics,$x2366-6331 ;$v3692 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540290087 320 $aIncludes bibliographical references and index. 327 $aExpression -- Spectral Clustering Gene Ontology Terms to Group Genes by Function -- Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression -- Clustering Gene Expression Series with Prior Knowledge -- A Linear Time Biclustering Algorithm for Time Series Gene Expression Data -- Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds -- Phylogeny -- A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem -- Computing the Quartet Distance Between Trees of Arbitrary Degree -- Using Semi-definite Programming to Enhance Supertree Resolvability -- An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree -- Pattern Identification in Biogeography -- On the Complexity of Several Haplotyping Problems -- A Hidden Markov Technique for Haplotype Reconstruction -- Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event -- Networks -- A Faster Algorithm for Detecting Network Motifs -- Reaction Motifs in Metabolic Networks -- Reconstructing Metabolic Networks Using Interval Analysis -- Genome Rearrangements -- A 1.375-Approximation Algorithm for Sorting by Transpositions -- A New Tight Upper Bound on the Transposition Distance -- Perfect Sorting by Reversals Is Not Always Difficult -- Minimum Recombination Histories by Branch and Bound -- Sequences -- A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds -- Generalized Planted (l,d)-Motif Problem with Negative Set -- Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI) -- The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity -- Multiple Structural RNA Alignmentwith Lagrangian Relaxation -- Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons -- Ortholog Clustering on a Multipartite Graph -- Linear Time Algorithm for Parsing RNA Secondary Structure -- A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance -- Structure -- Optimal Protein Threading by Cost-Splitting -- Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment -- Rotamer-Pair Energy Calculations Using a Trie Data Structure -- Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity -- The Main Structural Regularities of the Sandwich Proteins -- Discovery of Protein Substructures in EM Maps. 330 $aWe are pleased to present the proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI 2005) which took place in Mallorca, Spain, October 3-6, 2005. The WABI 2005 workshop was part of the ?ve ALGO 2005 conf- ence meetings, which, in addition to WABI, included ESA, WAOA, IWPEC, and ATMOS. WABI 2005 was sponsored by EATCS (the European Assoc- tion for Theoretical Computer Science), the ISCB (the International Society for Computational Biology), the Universitat Polit` ecnica de Catalunya, the U- versitat de les Illes Balears, and the Ministerio de Educaci´ on y Ciencia. See http://www.lsi.upc.edu/~wabi05/ for more details. The Workshop on Algorithms in Bioinformatics highlights research work speci'cally developed to address algorithmic problems in biosequence analysis. Theemphasisisthereforeonstatisticalandprobabilisticalgorithmsthataddress important problems in the ?eld of molecular and structural biology. At present, given the enormous scienti'c and technical e'orts in functional and structural genomics, the relevance of the problem is therefore constrained by the need for sound, e'cient and specialized algorithms, capable of achieving solutions that can be tested by the biological community. Indeed the ultimate goal is to - plement algorithms capable of extracting real features from real biological data sets. Therefore the workshop aims to present recent research results, including signi'cant work in progress, and to identify and explore directions of future research. 410 0$aLecture Notes in Bioinformatics,$x2366-6331 ;$v3692 606 $aLife sciences 606 $aComputer programming 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aLife Sciences 606 $aProgramming Techniques 606 $aAlgorithms 606 $aData Science 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 615 0$aLife sciences. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aLife Sciences. 615 24$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 676 $a572.0285 701 $aCasadio$b Rita$01759615 701 $aMyers$b Eugene W$g(Eugene Wimberly)$01890919 712 12$aWABI (Workshop) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910482997403321 996 $aAlgorithms in Bioinformatics$94533349 997 $aUNINA