LEADER 03719nam 2200613 450 001 996466071903316 005 20220419090435.0 010 $a1-280-80486-6 010 $a9786610804863 010 $a3-540-44888-8 024 7 $a10.1007/3-540-44888-8 035 $a(CKB)1000000000212027 035 $a(EBL)3036553 035 $a(SSID)ssj0000292013 035 $a(PQKBManifestationID)11228968 035 $a(PQKBTitleCode)TC0000292013 035 $a(PQKBWorkID)10255530 035 $a(PQKB)10288705 035 $a(DE-He213)978-3-540-44888-4 035 $a(MiAaPQ)EBC3036553 035 $a(MiAaPQ)EBC6690279 035 $a(Au-PeEL)EBL6690279 035 $a(PPN)155194704 035 $a(EXLCZ)991000000000212027 100 $a20220419d2003 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aCombinatorial pattern matching $e14th annual symposium, CPM 2003, Morelia, Michoacan, Mexico, June 25-27, 2003 : proceedings. /$fRicardo Baeza-Yates, Edgar Chavez, Maxime Crochemore (editors) 205 $a1st ed. 2003. 210 1$aBerlin :$cSpringer,$d[2003] 210 4$d??2003 215 $a1 online resource (411 p.) 225 1 $aLecture notes in computer science ;$v2676 300 $aDescription based upon print version of record. 311 $a3-540-40311-6 320 $aIncludes bibliographical references and index. 327 $aMultiple Genome Alignment: Chaining Algorithms Revisited -- Two-Dimensional Pattern Matching with Rotations -- An Improved Algorithm for Generalized Comparison of Minisatellites -- Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions -- Fast Lightweight Suffix Array Construction and Checking -- Distributed and Paged Suffix Trees for Large Genetic Databases -- Analysis of Tree Edit Distance Algorithms -- An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees -- Average-Optimal Multiple Approximate String Matching -- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms -- Haplotype Inference by Pure Parsimony -- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions -- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals -- Linear-Time Construction of Suffix Arrays -- Space Efficient Linear Time Construction of Suffix Arrays -- Tuning String Matching for Huge Pattern Sets -- Sparse LCS Common Substring Alignment -- On Minimizing Pattern Splitting in Multi-track String Matching -- Alignment between Two Multiple Alignments -- An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum -- Pattern Discovery in RNA Secondary Structure Using Affix Trees -- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs -- Complexities of the Centre and Median String Problems -- Extracting Approximate Patterns -- A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression -- Constrained Tree Inclusion -- Working on the Problem of Sorting by Transpositions on Genome Rearrangements -- Efficient Selection of Unique and Popular Oligos for Large EST Databases. 410 0$aLecture notes in computer science ;$v2676. 606 $aComputer algorithms$vCongresses 615 0$aComputer algorithms 676 $a005.1 702 $aBaeza-Yates$b R$g(Ricardo), 702 $aCha?vez$b Edgar 702 $aCrochemore$b Maxime 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466071903316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA