{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":40,"n_cols":5,"rows_kept":40,"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],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[21,2,21,3],[22,2,22,3],[33,2,33,3],[34,2,34,3],[38,2,38,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990000247970403321"]
[null,null,"Autore",null,"Bézier, Pierre"]
[null,null,"Titolo",null,"The mathematical basis of the UNISURF CAD system / Pierre Bézier"]
[null,null,"Pubbl/distr/stampa",null,"London : Butterworths & Co., 1986"]
[null,null,"ISBN",null,"0-408-22175-5"]
[null,null,"Descrizione fisica",null,"VIII, 56 p. ill. 26 cm"]
[null,null,"Disciplina",null,"620.00425"]
[null,null,"Locazione",null,"DINAE"]
[null,null,"Collocazione",null,"09 010-001"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996465843503316"]
[null,null,"Titolo",null,"Combinatorial Pattern Matching [[electronic resource] ] : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / / edited by Gregory Kucherov, Esko Ukkonen"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009"]
[null,null,"ISBN",null,"3-642-02441-6"]
[null,null,"Edizione",null,"[1st ed. 2009.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 370 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5577"]
[null,null,"Classificazione",null,"DAT 537f"]
[{"$nulls":4},"SS 4800"]
[null,null,"Disciplina",null,"004.0151"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Pattern recognition systems"]
[{"$nulls":4},"Bioinformatics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Information storage and retrieval systems"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Automated Pattern Recognition"]
[{"$nulls":4},"Computational and Systems Biology"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Information Storage and Retrieval"]
[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 and index."]
[null,null,"Nota di contenuto",null,"CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching "]
[{"$nulls":4},"with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)."]