04667nam0 22007333i 450 BVEE01655120170908093204.0t:e- reus t,s, spsu (3) 1543 (A)fei20150609d1543 ||||0itac50 balatitz01i xxxe z01n˜Pub. Ouidii Nasonis ... ÂœHeroides epistolae cum omnibus commentariis ubique locorum hactenus impressis, sed in pristinam integritatem redactis, atque ad amussim recognitis. His nos adiunximus emblemata argumenta, ac uarias lectiones ex optimis quibusque auctoribus collectas, et praeter adnotata ab Ioanne Baptista Egnatio, obseruationes Constantii Fanensis nuper in studiosorum utilitatem editas. Adiecta est etiam recta non paucorum versuum dispositio, ac interpretatio, per Aaronem Battaleum Triuiliensem acutissime excogitata. Ac haec Ioannis Scoppae expositiones super locis quibusdam obscurioribusVenetijsapud Hieronymum Scotum1543Venetijsapud Hieronymum Scotum[8], 209 [i.e. 207, 1] p.ill.folRiferimenti: EDIT 16 CNCE 31674Marca (V458) sul frontCors. ; gr. ; romSegn.: âœâ´Aâ¶Bâ´C-Râ¶Sâ´Omesse nella numerazione le p. 141-142.1 v. (Nota manoscritta di possesso sul frontespizio. - Legatura in pergamena con titolo in oro sul dorso)IT-NA0079, V.F. 110 M 6HeroidesCFI0204376CFIV00269013345Ibis.UFI0289904CFIV00269019637VeneziaSBLL003553Ovidius Naso, PubliusCFIV002690070154954Costanzi, Antonio <1436-1490>BVEV028803Battaglia, Aronne <sec. 16.>BVEV036552Scoppa, Lucio Giovanni <15-16.sec.>RMLV019544Egnazio, Giovanni BattistaRMLV020250Scoto, GirolamoBVEV016879650Constantius : FanensisBVEV036555Costanzi, Antonio <1436-1490>Constantius, Antonius : FanensisSBNV026447Costanzi, Antonio <1436-1490>Constanti, AntonioSBNV026448Costanzi, Antonio <1436-1490>Costanzo, AntonioSBNV026449Costanzi, Antonio <1436-1490>Antonio : da FanoSBNV026450Costanzi, Antonio <1436-1490>Battaleus, AaronBVEV036556Battaglia, Aronne <sec. 16.>OvidAQ1V000257Ovidius Naso, PubliusOvidio Nasone, PublioCFIV002693Ovidius Naso, PubliusOvidiuCFIV078917Ovidius Naso, PubliusOvidioCFIV156621Ovidius Naso, PubliusOvidio Nasone, P.CFIV160367Ovidius Naso, PubliusOvidius, Publius NasoCFIV228966Ovidius Naso, PubliusObidiosCFIV230653Ovidius Naso, PubliusOvidio Naso, PubliusSBNV006544Ovidius Naso, PubliusNasone, Publio OvidioSBNV047182Ovidius Naso, PubliusOvideUFIV122075Ovidius Naso, PubliusCipelli, Giovanni BattistaBVEV030017Egnazio, Giovanni BattistaEgnatius, BaptistaRMLV020252Egnazio, Giovanni BattistaEgnatius : VenetusSBNV014704Egnazio, Giovanni BattistaScotti, GirolamoBVEV054130Scoto, GirolamoScotto, GirolamoMILV339066Scoto, GirolamoScotus, HieronymusMUSV060174Scoto, GirolamoITIT-NA007920150609IT-NA0079Biblioteca Nazionale Vittorio Emanuele IIINA00791 esemplareShttp://books.google.com/books?vid=IBNN:BNVA1001552827BVEE016551BVEM000083Una quercia su un cumulo di rocce. Ai piedi dell'albero le iniziali S.O.S. = Signum Octaviani Scoti. Motto Caedit iniquos.V458Sul front.Biblioteca Nazionale Vittorio Emanuele III1 v. BNV.F. 110 M 6 BNVA10015528275G B 1 v. (Nota manoscritta di possesso sul frontespizio. - Legatura in pergamena con titolo in oro sul dorso)C 2015060920150609Legatura in pergamena con titolo in oro sul dorsoCaratteristiche materialiNota manoscritta di possesso sul frontespizioNote, dedica, postille e note di possesso manoscritteBiblioteca Nazionale Vittorio Emanuele III1 BNVA1001552827http://books.google.com/books?vid=IBNN:BNVA1001552827 BNV.F. 110 M 6 BNIbis19637Heroides13345UNISANNIO05461nam 22007695 450 99646624820331620200630171201.03-540-48450-710.1007/3-540-58094-8(CKB)1000000000234120(SSID)ssj0000321919(PQKBManifestationID)11255989(PQKBTitleCode)TC0000321919(PQKBWorkID)10281102(PQKB)10084558(DE-He213)978-3-540-48450-9(PPN)155222287(EXLCZ)99100000000023412020121227d1994 u| 0engurnn|008mamaatxtccrCombinatorial Pattern Matching[electronic resource] Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings /edited by Maxime Crochemore, Dan Gusfield1st ed. 1994.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1994.1 online resource (IX, 331 p.) Lecture Notes in Computer Science,0302-9743 ;807Bibliographic Level Mode of Issuance: Monograph3-540-58094-8 A space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance.This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years.Lecture Notes in Computer Science,0302-9743 ;807Pattern recognitionDiscrete mathematicsAlgorithmsInformation storage and retrievalCoding theoryInformation theoryCombinatoricsPattern Recognitionhttps://scigraph.springernature.com/ontologies/product-market-codes/I2203XDiscrete Mathematicshttps://scigraph.springernature.com/ontologies/product-market-codes/M29000Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Information Storage and Retrievalhttps://scigraph.springernature.com/ontologies/product-market-codes/I18032Coding and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15041Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Pattern recognition.Discrete mathematics.Algorithms.Information storage and retrieval.Coding theory.Information theory.Combinatorics.Pattern Recognition.Discrete Mathematics.Algorithm Analysis and Problem Complexity.Information Storage and Retrieval.Coding and Information Theory.Combinatorics.006.4Crochemore Maximeedthttp://id.loc.gov/vocabulary/relators/edtGusfield Danedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466248203316Combinatorial Pattern Matching772744UNISA