LEADER 05567nam 22008055 450 001 996465554903316 005 20200630140204.0 010 $a3-540-27801-X 024 7 $a10.1007/b98377 035 $a(CKB)1000000000212444 035 $a(SSID)ssj0000125254 035 $a(PQKBManifestationID)11144351 035 $a(PQKBTitleCode)TC0000125254 035 $a(PQKBWorkID)10026205 035 $a(PQKB)10600768 035 $a(DE-He213)978-3-540-27801-6 035 $a(MiAaPQ)EBC3087579 035 $a(PPN)155214357 035 $a(EXLCZ)991000000000212444 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings /$fedited by Suleyman C. Sahinalp, S. Muthukrishnan, Ugur Dogrusoz 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XII, 492 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3109 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22341-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aSorting by Reversals in Subquadratic Time -- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs -- Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity -- Optimizing Multiple Spaced Seeds for Homology Search -- Approximate Labelled Subtree Homeomorphism -- On the Average Sequence Complexity -- Approximate Point Set Pattern Matching on Sequences and Planes -- Finding Biclusters by Random Projections -- Real-Time String Matching in Sublinear Space -- On the k-Closest Substring and k-Consensus Pattern Problems -- A Trie-Based Approach for Compacting Automata -- A Simple Optimal Representation for Balanced Parentheses -- Two Algorithms for LCS Consecutive Suffix Alignment -- Efficient Algorithms for Finding Submasses in Weighted Strings -- Maximum Agreement and Compatible Supertrees -- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem -- Small Phylogeny Problem: Character Evolution Trees -- The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices -- A Computational Model for RNA Multiple Structural Alignment -- Computational Design of New and Recombinant Selenoproteins -- A Combinatorial Shape Matching Algorithm for Rigid Protein Docking -- Multi-seed Lossless Filtration -- New Results for the 2-Interval Pattern Problem -- A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes -- Sparse Normalized Local Alignment -- Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences -- Maximal Common Connected Sets of Interval Graphs -- Performing Local Similarity Searches with Variable Length Seeds -- Reversal Distance without Hurdles and Fortresses -- A Fast Set Intersection Algorithm for Sorted Sequences -- Faster Two Dimensional Pattern Matching with Rotations -- Compressed Compact Suffix Arrays -- Approximate String Matching Using Compressed Suffix Arrays -- Compressed Index for a Dynamic Collection of Texts -- Improved Single and Multiple Approximate String Matching -- Average-Case Analysis of Approximate Trie Search. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3109 606 $aPattern recognition 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputer science?Mathematics 606 $aInformation storage and retrieval 606 $aNatural language processing (Computer science) 606 $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X 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 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 615 0$aPattern recognition. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputer science?Mathematics. 615 0$aInformation storage and retrieval. 615 0$aNatural language processing (Computer science). 615 14$aPattern Recognition. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aInformation Storage and Retrieval. 615 24$aNatural Language Processing (NLP). 676 $a005.1 702 $aSahinalp$b Suleyman C$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMuthukrishnan$b S$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDogrusoz$b Ugur$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465554903316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA