01039nam2-22003251i-450-99000551154040332120060413150604.00691038554000551154FED01000551154(Aleph)000551154FED0100055115419990604d1971----km-y0itay50------baitaf-------00---5.: The Final PeriodLast Judgment, Frescoes of the Paulin Chapel, Last Pietasby Charles De TolnaySecond printing, with forewardPrincetonPrinceton University Press1971XI, 271 p., 376 tav.28 cm0010005510922001Michelangeloby Charles De TolnayMichelangeloSculture730.9221itaTolnay,Karoly<1899-1981>36416ITUNINARICAUNIMARCBK990005511540403321730.92 MIC 4 (5)ST.ARTE 11102FLFBCFLFBC5.: The Final Period609348UNINA00932cam2 22002773 450 SOBE0002009320170216121633.020111125d1974 |||||ita|0103 baitaIT4, 1NapoliJovene1974685 p.24 cm001SOB000000702001 Storia della Costituzione romana / Francesco De MartinoDe_Martino, FrancescoAF0000805707078850ITUNISOB20170216RICAUNISOBUNISOB34022157UNISOB34086518SOBE00020093M 102 Monografia moderna SBNW340008019-4,1SI22157catenacciUNISOBUNISOB20111125124851.020170215155453.0bethb340008019-4,1 bSI86518catenacciUNISOBUNISOB20111125124918.020170216121633.0bethb4, 11720571UNISOB03113oam 2200577 450 99646573670331620210717095633.03-540-48452-310.1007/3-540-48452-3(CKB)1000000000211098(SSID)ssj0000321915(PQKBManifestationID)11937840(PQKBTitleCode)TC0000321915(PQKBWorkID)10280252(PQKB)10348410(DE-He213)978-3-540-48452-3(MiAaPQ)EBC3072641(MiAaPQ)EBC6485745(PPN)155226282(EXLCZ)99100000000021109820210717d1999 uy 0engurnn#008mamaatxtccrCombinatorial pattern matching 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings /Maxime Crochemore, Mike Paterson, editors1st ed. 1999.Berlin :Springer,[1999]©19991 online resource (VIII, 304 p.)Lecture notes in computer science ;1645Bibliographic Level Mode of Issuance: Monograph3-540-66278-2 Includes bibliographical references and index.Shift-And Approach to Pattern Matching in LZW Compressed Text -- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text -- Pattern Matching in Text Compressed by Using Antidictionaries -- On the Structure of Syntenic Distance -- Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem -- Hybridization and Genome Rearrangement -- On the Complexity of Positional Sequencing by Hybridization -- GESTALT: Genomic Steiner Alignments -- Bounds on the Number of String Subsequences -- Approximate Periods of Strings -- Finding Maximal Pairs with Bounded Gap -- A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes -- A New Indexing Method for Approximate String Matching -- The Compression of Subsegments of Images Described by Finite Automata -- Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays -- Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions -- Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology -- Fast Multi-dimensional Approximate Pattern Matching -- Finding Common RNA Secondary Structures from RNA Sequences -- Finding Common Subsequences with Arcs and Pseudoknots -- Computing Similarity between RNA Structures.Lecture notes in computer science ;1645.Computer algorithmsCongressesCombinatorial analysisCongressesComputer algorithmsCombinatorial analysis005.1Crochemore Maxime1947-Paterson Michael S.MiAaPQMiAaPQUtOrBLWBOOK996465736703316Combinatorial Pattern Matching772744UNISA