LEADER 04312nam 2200601 a 450 001 9910483301103321 005 20200520144314.0 010 $a3-540-31562-4 010 $a3-540-26201-6 024 7 $a10.1007/b137128 035 $a(CKB)1000000000213051 035 $a(SSID)ssj0000316695 035 $a(PQKBManifestationID)11223761 035 $a(PQKBTitleCode)TC0000316695 035 $a(PQKBWorkID)10276501 035 $a(PQKB)10894841 035 $a(DE-He213)978-3-540-31562-9 035 $a(MiAaPQ)EBC3068328 035 $a(PPN)123095328 035 $a(EXLCZ)991000000000213051 100 $a20050509d2005 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial pattern matching $e16th annual symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005 : proceedings /$fAlberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.) 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$dc2005 215 $a1 online resource (XII, 452 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3537 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540262015 320 $aIncludes bibliographical references and index. 327 $aSharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance. 410 0$aLecture notes in computer science ;$v3537. 517 3 $aCPM 2005 606 $aComputer algorithms$vCongresses 606 $aCombinatorial analysis$vCongresses 615 0$aComputer algorithms 615 0$aCombinatorial analysis 676 $a511/.6 701 $aApostolico$b Alberto$f1948-$025875 701 $aCrochemore$b Maxime$f1947-$01617863 701 $aPark$b Kunsoo$01754970 712 12$aSymposium on Combinatorial Pattern Matching 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483301103321 996 $aCombinatorial pattern matching$94204360 997 $aUNINA