{"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],[3,2,3,3],[4,2,4,3],[6,2,6,3],[7,2,7,3],[14,2,14,3],[14,4,14,5],[15,2,15,3],[15,4,15,5],[16,2,16,3],[17,2,17,3],[19,2,19,3],[20,2,20,3],[21,2,21,3],[22,2,22,3],[23,2,23,3],[33,2,33,3],[34,2,34,3],[38,2,38,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996393022903316"]
[null,null,"Titolo",null,"Some books lately printed for, and to be sold by Abel Swall and Tim. Child at the Unicorn in St. Paul;s Church Yard [[electronic resource]]"]
[null,null,"Pubbl/distr/stampa",null,"[London?, : s.n., 16--?]"]
[null,null,"Descrizione fisica",null,"2 leaves ([2] p.)"]
[null,null,"Soggetti",null,"Catalogs, Publishers' - Great Britain - 17th century"]
[{"$nulls":4},"Advertising fliers17th century.EnglandLondon"]
[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","Twenty titles on two sheets, probably to be bound into copies of other works by the same printer(s)."]
[{"$nulls":4},"Imprint date conjectured from publication dates of titles listed."]
[{"$nulls":4},"The two sheets appear at separate reel positions, but appear by the catchword at E4:2[35a], to be consecutive."]
[{"$nulls":4},"Reproduction of original in: British Library."]
[null,null,null,"Sommario/riassunto","eebo-0018"]
[null,"2.","Record Nr.",null,"UNISA996466120403316"]
[null,null,"Titolo",null,"Combinatorial Pattern Matching [[electronic resource] ] : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005"]
[null,null,"ISBN",null,"3-540-31562-4"]
[{"$nulls":4},"3-540-26201-6"]
[null,null,"Edizione",null,"[1st ed. 2005.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 452 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3537"]
[null,null,"Disciplina",null,"511/.6"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Information storage and retrieval systems"]
[{"$nulls":4},"Natural language processing (Computer science)"]
[{"$nulls":4},"Pattern recognition systems"]
[{"$nulls":4},"Bioinformatics"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Information Storage and Retrieval"]
[{"$nulls":4},"Natural Language Processing (NLP)"]
[{"$nulls":4},"Automated Pattern Recognition"]
[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,"Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative "]
[{"$nulls":4},"Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance."]