03721nam 2200613 450 991014387080332120220419090435.01-280-80486-697866108048633-540-44888-810.1007/3-540-44888-8(CKB)1000000000212027(EBL)3036553(SSID)ssj0000292013(PQKBManifestationID)11228968(PQKBTitleCode)TC0000292013(PQKBWorkID)10255530(PQKB)10288705(DE-He213)978-3-540-44888-4(MiAaPQ)EBC3036553(MiAaPQ)EBC6690279(Au-PeEL)EBL6690279(PPN)155194704(EXLCZ)99100000000021202720220419d2003 uy 0engur|n|---|||||txtccrCombinatorial pattern matching 14th annual symposium, CPM 2003, Morelia, Michoacan, Mexico, June 25-27, 2003 : proceedings. /Ricardo Baeza-Yates, Edgar Chavez, Maxime Crochemore (editors)1st ed. 2003.Berlin :Springer,[2003]℗♭20031 online resource (411 p.)Lecture notes in computer science ;2676Description based upon print version of record.3-540-40311-6 Includes bibliographical references and index.Multiple 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.Lecture notes in computer science ;2676.Computer algorithmsCongressesComputer algorithms005.1Baeza-Yates R(Ricardo),Chávez EdgarCrochemore MaximeMiAaPQMiAaPQMiAaPQBOOK9910143870803321Combinatorial Pattern Matching772744UNINA