LEADER 01972nam 2200253z- 450 001 9910437754003321 005 20200409151657.0 035 $a(CKB)3820000000034521 035 $a(BIP)059987109 035 $a(EXLCZ)993820000000034521 100 $a20180416c2017uuuu -u- - 101 0 $aita 200 00$aItaly Invades : come gli italiani hanno conquistato il mondo / Christopher Kelly, Stuart Laycock ; traduzione di Chiara Moscardin ; [prefazione del generale Basilio Di Martino] 210 $aFirenze $cMauro Pagliai$d2017 215 $a1 online resource (288 p.) 311 $a88-564-0358-7 330 8 $aItalia terra di santi, poeti, navigatori e... conquistatori: dai tempi dell'impero romano, attraverso l'epoca delle grandi esplorazioni, fino ai giorni piu recenti della NATO e della cooperazione internazionale, gli italiani hanno raggiunto e invaso, con le armi o con la cultura, paesi distanti e diversi come Capo Verde, Mongolia o Uruguay, condizionandone ineluttabilmente il futuro. In un viaggio a ritroso nel tempo, con l'ausilio di mappe e fotografie, gli autori ci guidano attraverso secoli di "nostre" conquiste, narrando le gesta di avventurieri irrequieti, esploratori coraggiosi e grandi uomini d'arme. "Kelly e Laycock hanno creato una raccolta densa ma nel contempo scorrevole delle imprese di una nazione" Kirkus Reviews "Un libro scritto e documentato in modo superbo, che elenca tutti i paesi del mondo e il rispettivo coinvolgimento italiano, di tipo militare, economico o geopolitico" The Italian Tribune Edizione originale: Italy Invades: How Italians Conquered the World, Book Publisher Network, Bothell WA, 2015 I edizione italiana: luglio 2017 (traduzione di Chiara Moscardin) 517 $aItaly Invades 700 $aKelly$b Christopher$f1964-$0622658 702 $aLaycock$b Stuart 906 $aBOOK 912 $a9910437754003321 996 $aItaly Invades : come gli italiani hanno conquistato il mondo$94171058 997 $aUNINA LEADER 06687nam 22008535 450 001 9910483950803321 005 20251226202627.0 010 $a3-642-02441-6 024 7 $a10.1007/978-3-642-02441-2 035 $a(CKB)1000000000761222 035 $a(SSID)ssj0000316694 035 $a(PQKBManifestationID)11258543 035 $a(PQKBTitleCode)TC0000316694 035 $a(PQKBWorkID)10275019 035 $a(PQKB)10809819 035 $a(DE-He213)978-3-642-02441-2 035 $a(MiAaPQ)EBC3064303 035 $a(PPN)136306853 035 $a(BIP)27102713 035 $a(EXLCZ)991000000000761222 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching $e20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings /$fedited by Gregory Kucherov, Esko Ukkonen 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 370 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5577 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-02440-8 320 $aIncludes bibliographical references and index. 327 $aCPM?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 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 HaplotypeData -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). 330 $aIt is our great pleasure to introduce the proceedings of the 20th anniversary edition of the Annual Symposium on Combinatorial Pattern Matching (CPM). The meeting was held in Lille, France,hosted by the Laboratoired'Informatique Fondamentale de Lille (LIFL) a'liated with the Universit´ e de Lille 1 and the French Centre National de Recherche Scienti'que (CNRS), as well as by INRIA Lille - Nord Europe. Started in 1990as a summer school with about 30 invited participants, CPM quicklyevolvedintoarepresentativeannualinternationalconference.Principally motivated by combinatorial algorithms for search problems in strings (texts, sequences), the scope of CPM extended to more complex data structures such astrees,graphs,two-dimensionalarrays,or setsof points.Thosestudiesresulted inarichcollectionofalgorithmictechniquesanddatastructures,makingbridges to other parts of the theory of discrete algorithms and algorithm engineering. Today, the area of combinatorial pattern matching is a well-identi'ed active sub'eld of algorithmic research. Importantly, this development has been fertilized by a number of major - plication areas providing direct motivations and fruitful feedback to the CPM problematics. Those applications include data compression, computational bi- ogy,Internetsearch,datamining,informationretrieval,coding,naturallanguage processing,pattern recognition,music analysis, and others. On the one hand, all these areas make use of combinatorial pattern matching techniques and, on the otherhand,raisenewpatternmatchingproblems.Forexample,the fastprogress in computational molecular biology, triggered in the 1990s by the availability of mass genomic data, considerably in'uenced the combinatorial pattern matching ?eld: as an illustration, about one-third of the papers presented in this volume deal with problems related to bioinformatics applications. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5577 606 $aComputer science 606 $aPattern recognition systems 606 $aBioinformatics 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aInformation storage and retrieval systems 606 $aTheory of Computation 606 $aAutomated Pattern Recognition 606 $aComputational and Systems Biology 606 $aAlgorithms 606 $aData Science 606 $aInformation Storage and Retrieval 615 0$aComputer science. 615 0$aPattern recognition systems. 615 0$aBioinformatics. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aInformation storage and retrieval systems. 615 14$aTheory of Computation. 615 24$aAutomated Pattern Recognition. 615 24$aComputational and Systems Biology. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aInformation Storage and Retrieval. 676 $a004.0151 686 $aDAT 537f$2stub 686 $aSS 4800$2rvk 701 $aKucherov$b Gregory$01760411 701 $aUkkonen$b E$g(Esko),$f1950-$01760412 712 12$aSymposium on Combinatorial Pattern Matching 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483950803321 996 $aCombinatorial pattern matching$94199373 997 $aUNINA