{"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],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[21,2,21,3],[22,2,22,3],[26,2,26,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465846203316"]
[null,null,"Titolo",null,"Combinatorial Pattern Matching [[electronic resource] ] : 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings, / / edited by Amihood Amir, Laxmi Parida"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38700-9"]
[{"$nulls":4},"9786613564924"]
[{"$nulls":4},"3-642-13509-9"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 362 p. 84 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6129"]
[null,null,"Disciplina",null,"006.4015116"]
[null,null,"Soggetti",null,"Pattern recognition systems"]
[{"$nulls":4},"Life sciences"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Artificial intelligence—Data processing"]
[{"$nulls":4},"Data mining"]
[{"$nulls":4},"Automated Pattern Recognition"]
[{"$nulls":4},"Life Sciences"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Data Science"]
[{"$nulls":4},"Data Mining and Knowledge Discovery"]
[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,"Algorithms for Forest Pattern Matching -- Affine Image Matching Is Uniform -Complete -- Old and New in Stringology -- Small-Space 2D Compressed Dictionary Matching -- Bidirectional Search in a String with Wavelet Trees -- A Minimal Periods Algorithm with Applications -- The Property Suffix Tree with Dynamic Properties -- Approximate All-Pairs Suffix/Prefix Overlaps -- Succinct Dictionary Matching with No Slowdown -- Pseudo-realtime Pattern Matching: Closing the Gap -- Breakpoint Distance and PQ-Trees -- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs -- Succinct Representations of Separable Graphs -- Implicit Hitting Set Problems and Multi-genome Alignment -- Bounds on the Minimum "]
[{"$nulls":4},"Mosaic of Population Sequences under Recombination -- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection -- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints -- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks -- Mod/Resc Parsimony Inference -- Extended Islands of Tractability for Parsimony Haplotyping -- Sampled Longest Common Prefix Array -- Verifying a Parameterized Border Array in O(n 1.5) Time -- Cover Array String Reconstruction -- Compression, Indexing, and Retrieval for Massive String Data -- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality -- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach -- Algorithms for Three Versions of the Shortest Common Superstring Problem -- Finding Optimal Alignment and Consensus of Circular Strings -- Optimizing Restriction Site Placement for Synthetic Genomes -- Extension and Faster Implementation of the GRP Transform for Lossless Compression -- Parallel and Distributed Compressed Indexes."]