{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910144195003321"]
[null,null,"Titolo",null,"Combinatorial Pattern Matching : 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings / / edited by Suleyman C. Sahinalp, S. Muthukrishnan, Ugur Dogrusoz"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004"]
[null,null,"ISBN",null,"3-540-27801-X"]
[null,null,"Edizione",null,"[1st ed. 2004.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 492 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 3109"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Pattern perception"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Information storage and retrieval"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Pattern Recognition"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Data Structures"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Information Storage and Retrieval"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references at the end of each chapters and index."]
[null,null,"Nota di contenuto",null,"Sorting 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 "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","The 15th Annual Symposium on Combinatorial Pattern Matching was held in Ciragan Palace Hotel, Istanbul, Turkey during July 5-7, 2004. CPM 2004 - peated the success of its predecessors; it even surpassed them in terms of the numberofinvitedspeakers,thenumberofsubmissions,andthenumberofpapers accepted and presented at the conference. In response to the call for papers, CPM 2004 received a record number of 79 high-quality submissions. Each submission was reviewed by at least three program committee members and the comments were returned to the authors. Following an extensive electronic discussion period, the Program Committee accepted36ofthesubmissionstobepresentedattheconference.Theyconstitute originalresearchcontributionsincombinatorialpatternmatchingalgorithmsand datastructures,molecularsequenceanalysis,phylogenetictreeconstruction,and RNA and protein structure analysis and prediction. CPM 2004 had ?ve invited speakers. In alphabetical order they were: Evan Eichler from the University of Washington, USA, Martin Farach-Colton from Rutgers University, USA, Paolo Ferragina from the University of Pisa, Italy, Piotr Indyk from MIT, USA, and Gene Myers from the University of California, Berkeley, USA. It is impossible to organize such a successful program without the help of many individuals. We would like to express our appreciation to the authors of the submitted papers and to the program committee members and external referees, who provided timely and signi'cant reviews. July 2004 S.C. Sahinalp, S. Muthukrishnan, U. Dogrusoz Organization CPM 2004 was locally organized by Bilkent University, Ankara, Turkey. Within Bilkent University, the Center for Bioinformatics (BCBI) and the Computer Engineering Department cooperated."]