{"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":19,"n_cols":5,"rows_kept":19,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[12,2,12,3],[13,2,13,3],[17,2,17,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910780989903321"]
[null,null,"Titolo",null,"Combinatorics of genome rearrangements / / Guillaume Fertin [and others]"]
[null,null,"Pubbl/distr/stampa",null,"Cambridge, Mass., : MIT Press, ©2009"]
[null,null,"ISBN",null,"0-262-25818-8"]
[{"$nulls":4},"0-262-25875-7"]
[null,null,"Descrizione fisica",null,"1 online resource (305 p.)"]
[null,null,"Collana",null,"Computational molecular biology"]
[null,null,"Disciplina",null,"572.8/77"]
[null,null,"Soggetti",null,"Translocation (Genetics) - Mathematical models"]
[{"$nulls":4},"Translocation (Genetics) - Data processing"]
[{"$nulls":4},"Combinatorial analysis"]
[{"$nulls":4},"Genomics - Mathematics"]
[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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [263]-282) and index."]
[null,null,"Nota di contenuto",null,"Genomes as permutations -- Distances between unsigned permutations -- Distances between signed permutations -- Rearrangements of partial orders -- Graph-theoretic and linear algebra formulations -- Generalities -- Distances between arbitrary strings -- Distances between balanced strings -- Paths and cycles -- Cycles of a permutation -- Set systems and the syntenic distance -- Median and halving problems -- Rearrangement phylogenies -- Software -- Open problems."]
[null,null,null,"Sommario/riassunto","A comprehensive survey of a rapidly expanding field of combinatorial optimization, mathematically orientated but offering biological explanations when required, this volume offers the first comprehensive survey of a rapidly expanding application of combinatorial optimization."]