LEADER 06618nam 22007815 450 001 996465894603316 005 20230221015735.0 010 $a3-540-73437-6 024 7 $a10.1007/978-3-540-73437-6 035 $a(CKB)1000000000490389 035 $a(SSID)ssj0000316692 035 $a(PQKBManifestationID)11273177 035 $a(PQKBTitleCode)TC0000316692 035 $a(PQKBWorkID)10276213 035 $a(PQKB)10415570 035 $a(DE-He213)978-3-540-73437-6 035 $a(MiAaPQ)EBC3067841 035 $a(PPN)123163463 035 $a(EXLCZ)991000000000490389 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings /$fedited by Bin Ma, Kaizhong Zhang 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XII, 368 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4580 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-73436-8 320 $aIncludes bibliographical references and index. 327 $aInvited Talks (Abstracts) -- A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search -- Stringology: Some Classic and Some Modern Problems -- Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors -- Session 1: Alogirthmic Techniques I -- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions -- On Demand String Sorting over Unbounded Alphabets -- Session 2: Approximate Pattern Matching -- Finding Witnesses by Peeling -- Cache-Oblivious Index for Approximate String Matching -- Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts -- Self-normalised Distance with Don?t Cares -- Session 3: Data Compression I -- Move-to-Front, Distance Coding, and Inversion Frequencies Revisited -- A Lempel-Ziv Text Index on Secondary Storage -- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts -- Most Burrows-Wheeler Based Compressors Are Not Optimal -- Session 4: Computational Biology I -- Non-breaking Similarity of Genomes with Gene Repetitions -- A New and Faster Method of Sorting by Transpositions -- Finding Compact Structural Motifs -- Session 5: Computational Biology II -- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants -- Computing Exact p-Value for Structured Motif -- Session 6: Algorithmic Techniques II -- Improved Sketching of Hamming Distance with Error Correcting -- Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications -- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge -- Space-Efficient Algorithms for Document Retrieval -- Session 7: Data Compression II -- Compressed Text Indexes with Fast Locate -- Processing Compressed Texts: A Tractability Border -- Session 8: Computational Biology III -- Common Structured Patterns in Linear Graphs: Approximation and Combinatorics -- Identification of Distinguishing Motifs -- Algorithms for Computing the Longest Parameterized Common Subsequence -- Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem -- Session 9: Pattern Analysis -- Two-Dimensional Range Minimum Queries -- Tiling Periodicity -- Fast and Practical Algorithms for Computing All the Runs in a String -- Longest Common Separable Pattern Among Permutations -- Session 10: Suffix Arrays and Trees -- Suffix Arrays on Words -- Efficient Computation of Substring Equivalence Classes with Suffix Arrays -- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. 330 $aThe papers contained in this volume were presented at the 18th Annual S- posium on Combinatorial Pattern Matching (CPM 2007) held at the University of Western Ontario, in London, Ontario, Canada from July 9 to 11, 2007. All the papers presented at the conference are original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, su?x arrays and trees, and computational biology. They were selected from 64 submissions. Each submission was reviewed by at least three reviewers. The committee decided to accept 32 papers. The p- gramme also included three invited talks by Tao Jiang from the University of California, Riverside, USA, S. Muthukrishnan from Rutgers University, USA, and Frances Yao from City University of Hong Kong, Hong Kong. Combinatorial Pattern Matching addresses issues of searching and matching stringsandmorecomplicatedpatternssuchastrees,regularexpressions,graphs, point sets, and arrays.The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed e?ciently. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4580 606 $aPattern recognition systems 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aData mining 606 $aBioinformatics 606 $aArtificial intelligence?Data processing 606 $aAutomated Pattern Recognition 606 $aAlgorithms 606 $aNatural Language Processing (NLP) 606 $aData Mining and Knowledge Discovery 606 $aComputational and Systems Biology 606 $aData Science 615 0$aPattern recognition systems. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science). 615 0$aData mining. 615 0$aBioinformatics. 615 0$aArtificial intelligence?Data processing. 615 14$aAutomated Pattern Recognition. 615 24$aAlgorithms. 615 24$aNatural Language Processing (NLP). 615 24$aData Mining and Knowledge Discovery. 615 24$aComputational and Systems Biology. 615 24$aData Science. 676 $a005.1 702 $aMa$b Bin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZhang$b Kaizhong$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Combinatorial Pattern Matching 906 $aBOOK 912 $a996465894603316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA LEADER 01056nam0 22002651i 450 001 VAN00044441 005 20240806100431.448 100 $a20060419d1966 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aˆIl ‰Greco$f[studio critico-biografico a cura di Paul Guinard] 210 $aMilano$cFabbri ; Skira$d1966 215 $a141 p.$c53 riproduzioni$d28 cm. 410 1$1001VAN00044074$12001 $aˆIl ‰gusto del nostro tempo$1210 $aMilano$cFabbri ; Ginevra$cSkira. 620 $dMilano$3VANL000284 702 1$aGuinard$bPaul$3VANV035851 712 $aFabbri, Fabrizio $3VANV108057$4650 712 $aSkira $3VANV108061$4650 801 $aIT$bSOL$c20240906$gRICA 899 $aBIBLIOTECA DEL DIPARTIMENTO DI LETTERE E BENI CULTURALI$1IT-CE0103$2VAN07 912 $aVAN00044441 950 $aBIBLIOTECA DEL DIPARTIMENTO DI LETTERE E BENI CULTURALI$d07CONS Pb Greco 906 $e07 13970 20060529 996 $aGreco$9157543 997 $aUNICAMPANIA