04497 am 2200781 n 450 9910674059903321202107092-7351-2622-610.4000/books.editionsmsh.44940(CKB)5670000000617112(FrMaCLE)OB-editionsmsh-44940(PPN)268465657(EXLCZ)99567000000061711220230227j|||||||| ||| 0freuu||||||m||||Les jardins du Carrousel (Paris) De la campagne à la ville : la formation d’un espace urbain /Paul Van OsselParis Éditions de la Maison des sciences de l’homme20211 online resource (384 p.) 2-7351-0796-5 Au cœur de Paris, le projet du Grand Louvre suscita des fouilles urbaines d’une ampleur exceptionnelle. Tant par la nature des découvertes que par la maîtrise des stratégies de recherche, cette opération archéologique fut un modèle du genre. Voici la synthèse des études menées sur ce site prestigieux où s’accumulèrent, au fil de l’évolution d’un espace rural puis urbain, les traces laissées par l’homme de ta Préhistoire au XIXe s. Aux fosses et mobiliers des agriculteurs du Néolithique et de la Protohistoire succèdent une carrière de limon puis le parcellaire d’un suburbium de Lutèce, encore présent au IXe s. Un manoir du XIVe s., omé de peintures murales, précède l’emprise de la ville sur ce secteur par l’enceinte de Charles V et le faubourg attenant, tandis que les tuileries restent actives durant trois siècles. Au XVIe s., le site est bouleversé par la construction du château des Tuileries et du jardin Neuf. L’interprétation des multiples vestiges, étayée par les études paléoenvironnementales et les documents d’archives, fournit des données neuves, voire inattendues, sur l’utilisation des sols avant l’urbanisation, la condition des habitants, la destinée d’édifices célèbres. Ainsi ce livre nous conte une histoire, « celle d’un petit coin de Paris », haut lieu de l’Histoire de France. An OverView is presented here of the studies conducted at this prestigious site, where as a rural, then an urban space developed. the traces left by humankind from prehistoric times to the 19th century have accumulated. The trenches and material of farmers of Neolithic and protohistoric times gave way to a silt quarry, then to the plots of land in a suburbium outside of Lutetia, still present in the 9th century. A 14th century manor house, decorated with mural paintings, preceded the city’s encroachment on this area, seen in the Charles V city wall and the neighbouring faubourg, while the tile Works continued to be active for three centuries. In the 16th century the site was…Jardins du Carrousel Archaeologyarchéologie urbainepaléoenvironnementtopographie urbainepédologieBronze finalenceinte urbainearchitecture civile et militairecampagnes gallo-romainescarrière de limonchâteau des Tuileriesculture de CernyLa Tène anciennelogis des Suissesmanoir du bas Moyen Âgeparcellaire antiquetuilerie parisienneArchaeologyarchéologie urbainepaléoenvironnementtopographie urbainepédologieBronze finalenceinte urbainearchitecture civile et militairecampagnes gallo-romainescarrière de limonchâteau des Tuileriesculture de CernyLa Tène anciennelogis des Suissesmanoir du bas Moyen Âgeparcellaire antiquetuilerie parisienneBarré François1331157Dufaÿ Bruno1291562Faucherre Nicolas727206Goudineau Christian164724Guillaume Jean395058Léonelli Marie‑Claude1363827Van Ossel Paul172657FR-FrMaCLEBOOK9910674059903321Les jardins du Carrousel (Paris)3385004UNINA05544nam 2200733 a 450 991082559160332120200520144314.09786612939631978128293963912829396379780470892091047089209997804708921070470892102(CKB)2480000000008391(EBL)698862(SSID)ssj0000466837(PQKBManifestationID)11293080(PQKBTitleCode)TC0000466837(PQKBWorkID)10466607(PQKB)10770091(MiAaPQ)EBC698862(WaSeSS)IndRDA00019615(PPN)190203986(CaSebORM)9781118101988(OCoLC)701308667(Perlego)2750476(EXLCZ)99248000000000839120110308d2011 uy 0engur|n|---|||||txtccrAlgorithms in computational molecular biology techniques, approaches and applications /edited by Mourad Elloumi, Albert Y. ZomayaHoboken, N.J. Wiley20111 online resource (1085 p.)Wiley series on bioinformaticsDescription based upon print version of record.9781118101988 1118101987 9780470505199 0470505192 Includes bibliographical references and index.ALGORITHMS INCOMPUTATIONALMOLECULAR BIOLOGY; CONTENTS; PREFACE; CONTRIBUTORS; I STRINGS PROCESSING AND APPLICATION TO BIOLOGICAL SEQUENCES; 1 STRING DATA STRUCTURES FOR COMPUTATIONAL MOLECULAR BIOLOGY; 1.1 Introduction; 1.2 Main String Indexing Data Structures; 1.2.1 Suffix Trees; 1.2.2 Suffix Arrays; 1.3 Index Structures for Weighted Strings; 1.4 Index Structures for Indeterminate Strings; 1.5 String Data Structures in Memory Hierarchies; 1.6 Conclusions; References; 2 EFFICIENT RESTRICTED-CASE ALGORITHMS FOR PROBLEMS IN COMPUTATIONAL BIOLOGY; 2.1 The Need for Special Cases2.2 Assessing Efficient Solvability Options for General Problems and Special Cases2.3 String and Sequence Problems; 2.4 Shortest Common Superstring; 2.4.1 Solving the General Problem; 2.4.2 Special Case: SCSt for Short Strings Over Small Alphabets; 2.4.3 Discussion; 2.5 Longest Common Subsequence; 2.5.1 Solving the General Problem; 2.5.2 Special Case: LCS of Similar Sequences; 2.5.3 Special Case: LCS Under Symbol-Occurrence Restrictions; 2.5.4 Discussion; 2.6 Common Approximate Substring; 2.6.1 Solving the General Problem; 2.6.2 Special Case: Common Approximate String; 2.6.3 Discussion2.7 ConclusionReferences; 3 FINITE AUTOMATA IN PATTERN MATCHING; 3.1 Introduction; 3.1.1 Preliminaries; 3.2 Direct Use of DFA in Stringology; 3.2.1 Forward Automata; 3.2.2 Degenerate Strings; 3.2.3 Indexing Automata; 3.2.4 Filtering Automata; 3.2.5 Backward Automata; 3.2.6 Automata with Fail Function; 3.3 NFA Simulation; 3.3.1 Basic Simulation Method; 3.3.2 Bit Parallelism; 3.3.3 Dynamic Programming; 3.3.4 Basic Simulation Method with Deterministic State Cache; 3.4 Finite Automaton as Model of Computation; 3.5 Finite Automata Composition; 3.6 Summary; References4 NEW DEVELOPMENTS IN PROCESSING OF DEGENERATE SEQUENCES4.1 Introduction; 4.1.1 Degenerate Primer Design Problem; 4.2 Background; 4.3 Basic Definitions; 4.4 Repetitive Structures in Degenerate Strings; 4.4.1 Using the Masking Technique; 4.4.2 Computing the Smallest Cover of the Degenerate String x; 4.4.3 Computing Maximal Local Covers of x; 4.4.4 Computing All Covers of x; 4.4.5 Computing the Seeds of x; 4.5 Conservative String Covering in Degenerate Strings; 4.5.1 Finding Constrained Pattern p in Degenerate String T; 4.5.2 Computing ?-Conservative Covers of Degenerate Strings4.5.3 Computing ?-Conservative Seeds of Degenerate Strings4.6 Conclusion; References; 5 EXACT SEARCH ALGORITHMS FOR BIOLOGICAL SEQUENCES; 5.1 Introduction; 5.2 Single Pattern Matching Algorithms; 5.2.1 Algorithms for DNA Sequences; 5.2.2 Algorithms for Amino Acids; 5.3 Algorithms for Multiple Patterns; 5.3.1 Trie-Based Algorithms; 5.3.2 Filtering Algorithms; 5.3.3 Other Algorithms; 5.4 Application of Exact Set Pattern Matching for Read Mapping; 5.4.1 MPSCAN: An Efficient Exact Set Pattern Matching Tool for DNA/RNA Sequences; 5.4.2 Other Solutions for Mapping Reads5.4.3 Comparison of Mapping SolutionsThis book represents the most comprehensive and up-to-date collection of information on the topic of computational molecular biology. Bringing the most recent research into the forefront of discussion, Algorithms in Computational Molecular Biology studies the most important and useful algorithms currently being used in the field, and provides related problems. It also succeeds where other titles have failed, in offering a wide range of information from the introductory fundamentals right up to the latest, most advanced levels of study.Wiley series on bioinformatics.BiophysicsMathematical modelsBiophysicsMathematical models.572.80285Elloumi Mourad1662660Zomaya Albert Y521938MiAaPQMiAaPQMiAaPQBOOK9910825591603321Algorithms in computational molecular biology4060644UNINA