LEADER 06909nam 2200577Ia 450 001 9910451258303321 005 20200520144314.0 010 $a981-277-822-5 035 $a(CKB)1000000000405227 035 $a(StDuBDS)AH24684799 035 $a(SSID)ssj0000185540 035 $a(PQKBManifestationID)11174666 035 $a(PQKBTitleCode)TC0000185540 035 $a(PQKBWorkID)10208128 035 $a(PQKB)11616036 035 $a(MiAaPQ)EBC1681443 035 $a(WSP)00004838 035 $a(Au-PeEL)EBL1681443 035 $a(CaPaEBR)ebr10201155 035 $a(CaONFJC)MIL505453 035 $a(OCoLC)855898905 035 $a(EXLCZ)991000000000405227 100 $a20030204d2002 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aJewels of stringology$b[electronic resource] /$fMaxime Crochemore, Wojciech Rytter 210 $aSingapore ;$aRiver Edge, NJ $cWorld Scientific$d2002 215 $ax, 310 p. $cill 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a981-02-4782-6 320 $aIncludes bibliography references and index. 327 $a1. Stringology. 1.1. Text file facilities. 1.2. Dictionaries. 1.3. Data compression. 1.4. Applications of text algorithms in genetics. 1.5. Efficiency of algorithms. 1.6. Some notation and formal definitions. 1.7. Some simple combinatorics of strings. 1.8. Some other interesting strings. 1.9. Cyclic shifts and primitive words -- 2. Basic string searching algorithms. 2.1. Knuth-Morris-Pratt algorithm. 2.2. Boyer-Moore algorithm and its variations -- 3. Preprocessing for basic searchings. 3.1. Preprocessing patterns for MP and KMP algorithms. 3.2. Table of prefixes. 3.3. Preprocessing for Boyer-Moore algorithm. 3.4. * Analysis of Boyer-Moore algorithm -- 4. On-line construction of suffix trees. 4.1. Tries and their compact versions. 4.2. Prelude to Ukkonen algorithm. 4.3. Ukkonen algorithm -- 5. More on suffix trees. 5.1. Several applications of suffix trees. 5.2. McCreight algorithm -- 6. Subword graphs. 6.1. Directed acyclic graph. 6.2. On-line construction of subword graphs. 6.3. The reverse perspective. 6.4. Compact subword graphs -- 7. Text algorithms related to sorting. 7.1. The naming technique: KMR algorithm. 7.2. Two-dimensional KMR algorithm. 7.3. Suffix arrays. 7.4. Constructing suffix trees by sorting. 7.5. The Lowest-Common-Ancestor dictionary. 7.6. Suffix-Merge-Sort -- 8. Symmetries and repetitions in texts. 8.1. Searching for symmetric words. 8.2. Compositions of symmetric words. 8.3. Searching for square factors -- 9. Constant-space searchings. 9.1. Constant-space matching for easy patterns. 9.2. MaxSuffix-matching. 9.3. Computation of maximal suffixes. 9.4. Matching patterns with short maximal suffixes. 9.5. Two-way matching and magic decomposition. 9.6. Sequential sampling for unordered alphabets. 9.7. Galil-Seiferas algorithm. 9.8. Cyclic equality of words -- 10. Text compression techniques. 10.1. Substitutions. 10.2. Static Huffman coding. 10.3. Dynamic Huffman coding. 10.4. Factor encoding -- 11. Automata-theoretic approach. 11.1. Aho-Corasick automaton. 11.2. Determinizing automata. 11.3. Two-way pushdown automata -- 12. Approximate pattern matching. 12.1. Edit distance. 12.2. Longest common subsequence problem. 12.3. String matching with errors. 12.4. String matching with don't care symbols -- 13. Matching by dueling and sampling. 13.1. String matching by duels. 13.2. String matching by sampling -- 14. Two-dimensional pattern matching. 14.1. Multi-pattern approach. 14.2. Don't cares and non-rectangular patterns. 14.3. 2D-Pattern matching with mismatches. 14.4. Multi-pattern matching. 14.5. Matching by sampling. 14.6. An algorithm fast on the average -- 15. Two-dimensional periodicities. 15.1. Amir-Benson-Farach algorithm. 15.2. Geometry of two-dimensional periodicities. 15.3. * Patterns with large monochromatic centers. 15.4. * A version of the Galil-Park algorithm -- 16. Parallel text algorithms. 16.1. The abstract model of parallel computing. 16.2. Parallel string-matching algorithms. 16.3. * Splitting technique. 16.4. Parallel KMR algorithm and application. 16.5. Parallel Huffman coding. 16.6. Edit distance - efficient parallel computation -- 17. Miscellaneous. 17.1. Karp-Rabin string matching by hashing. 17.2. Shortest common superstrings. 17.3. Unique-decipherability problem. 17.4. Parameterized pattern matching. 17.5. Breaking paragraphs into lines. 330 $aThe term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms. In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms. 606 $aComputer algorithms 606 $aMatching theory 608 $aElectronic books. 615 0$aComputer algorithms. 615 0$aMatching theory. 676 $a005.1 700 $aCrochemore$b Maxime$f1947-$0878136 701 $aRytter$b Wojciech$0632280 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910451258303321 996 $aJewels of stringology$91960465 997 $aUNINA LEADER 04393nam 2200697Ia 450 001 9910461728203321 005 20210519221105.0 010 $a0-691-15292-6 010 $a1-280-49455-7 010 $a9786613589781 010 $a1-4008-4257-3 024 7 $a10.1515/9781400842575 035 $a(CKB)2670000000155727 035 $a(EBL)868306 035 $a(OCoLC)779828668 035 $a(SSID)ssj0000632947 035 $a(PQKBManifestationID)11389680 035 $a(PQKBTitleCode)TC0000632947 035 $a(PQKBWorkID)10616013 035 $a(PQKB)10299402 035 $a(MiAaPQ)EBC868306 035 $a(StDuBDS)EDZ0000515132 035 $a(MdBmJHUP)muse43322 035 $a(DE-B1597)453815 035 $a(OCoLC)979954416 035 $a(DE-B1597)9781400842575 035 $a(Au-PeEL)EBL868306 035 $a(CaPaEBR)ebr10539189 035 $a(CaONFJC)MIL358978 035 $a(EXLCZ)992670000000155727 100 $a20110720d2012 uy 0 101 0 $aeng 135 $aurun#---|u||u 181 $ctxt 182 $cc 183 $acr 200 10$aBuilding the judiciary$b[electronic resource] $elaw, courts, and the politics of institutional development /$fJustin Crowe 205 $aCourse Book 210 $aPrinceton $cPrinceton University Press$d2012 215 $a1 online resource (313 p.) 225 0 $aPrinceton studies in American politics : historical, international, and comparative perspectives 300 $aIncludes index. 311 0 $a0-691-15293-4 320 $aIncludes bibliographical references and index. 327 $tFront matter --$tContents --$tAcknowledgments /$rCrowe, Justin --$tChapter One. The Puzzle of Judicial Institution Building --$tChapter Two. The Early Republic --$tChapter Three. Jeffersonian and Jacksonian Democracy --$tChapter Four. The Civil War and Reconstruction --$tChapter Five. The Gilded Age and the Progressive Era --$tChapter Six. The Interwar and New Deal Years --$tChapter Seven. Modern America --$tChapter Eight. Judicial Power in a Political World --$tIndex --$tBackmatter 330 $aHow did the federal judiciary transcend early limitations to become a powerful institution of American governance? How did the Supreme Court move from political irrelevance to political centrality? Building the Judiciary uncovers the causes and consequences of judicial institution-building in the United States from the commencement of the new government in 1789 through the close of the twentieth century. Explaining why and how the federal judiciary became an independent, autonomous, and powerful political institution, Justin Crowe moves away from the notion that the judiciary is exceptional in the scheme of American politics, illustrating instead how it is subject to the same architectonic politics as other political institutions. Arguing that judicial institution-building is fundamentally based on a series of contested questions regarding institutional design and delegation, Crowe develops a theory to explain why political actors seek to build the judiciary and the conditions under which they are successful. He both demonstrates how the motivations of institution-builders ranged from substantive policy to partisan and electoral politics to judicial performance, and details how reform was often provoked by substantial changes in the political universe or transformational entrepreneurship by political leaders. Embedding case studies of landmark institution-building episodes within a contextual understanding of each era under consideration, Crowe presents a historically rich narrative that offers analytically grounded explanations for why judicial institution-building was pursued, how it was accomplished, and what--in the broader scheme of American constitutional democracy--it achieved. 410 0$aPrinceton Studies in American Politics: Historical, International, and Comparative Perspectives 606 $aCourts$zUnited States$xHistory 606 $aProcedure (Law)$zUnited States$xHistory 608 $aElectronic books. 615 0$aCourts$xHistory. 615 0$aProcedure (Law)$xHistory. 676 $a347.73/109 700 $aCrowe$b Justin$f1981-$01041019 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910461728203321 996 $aBuilding the judiciary$92464277 997 $aUNINA