Jewels of stringology
The 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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | eBook Book |
| Language: | English |
| Published: |
New Jersey ; Singapore
World Scientific
2002
World Scientific Publishing Company World Scientific Publishing |
| Edition: | 1 |
| Subjects: | |
| ISBN: | 9789810247829, 9810247826 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The 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.Contents:StringologyBasic String Searching AlgorithmsPreprocessing for Basic SeachingsOn-Line Construction of Suffix TreesMore on Suffix TreesSubword GraphsText Algorithms Related to SortingSymmetries and Repetitions in TextsConstant-Space SearchingsText Compression TechniquesAutomata-Theoretic ApproachApproximate Pattern MatchingMatching by Dueling and SamplingTwo-Dimensional Pattern MatchingTwo-Dimensional PeriodicitiesParallel Text AlgorithmsMiscellaneousReadership: Undergraduates, graduate students and researchers in algorithmics. |
|---|---|
| AbstractList | The 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.Contents:StringologyBasic String Searching AlgorithmsPreprocessing for Basic SeachingsOn-Line Construction of Suffix TreesMore on Suffix TreesSubword GraphsText Algorithms Related to SortingSymmetries and Repetitions in TextsConstant-Space SearchingsText Compression TechniquesAutomata-Theoretic ApproachApproximate Pattern MatchingMatching by Dueling and SamplingTwo-Dimensional Pattern MatchingTwo-Dimensional PeriodicitiesParallel Text AlgorithmsMiscellaneousReadership: Undergraduates, graduate students and researchers in algorithmics. |
| Author | Rytter, Wojciech Crochemore, Maxime |
| Author_xml | – sequence: 1 fullname: Crochemore, Maxime – sequence: 2 fullname: Rytter, Wojciech |
| BackLink | https://cir.nii.ac.jp/crid/1130282270642226816$$DView record in CiNii |
| BookMark | eNpVj71PwzAQxY2giLZkZO-AhBgi2WfHHyNE5UuVWBBrlDrnEmrFEAeq_vcYAgNvuNO9--npbkaOutDhAcmM0kYzUEoDwOHfTEEkw0zIDCjlIJP0MZnqokhbQ4sTksX4SpNY8gSdkrMH3KGPi-AWcejbbhN82OxPycTVPmL22-fk-Wb5VN7lq8fb-_JqldeF0lzkWmhjLYJThW1qcFwY2zTopNKOg4KCO-NUrTiuGVJpLcjGUFSCpdONs3xOLsfgOm5xF1-CH2L16XEdwjZW_55M7MXIvvXh_QPjUP1gFruhr321vC6Z1EwInsjzkezatrLtd2WMU0gxikqRwhIo-Re9lVgP |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 005.1 |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9789812778222 9812778225 |
| Edition | 1 |
| ExternalDocumentID | 9789812778222 EBC1681443 BA58976873 |
| GroupedDBID | -VX 089 20A 38. 9WS A4I A4J AABBV AATMT ABARN ABCYV ABIAV ABMRC ABQPQ ACLGV ACZWY ADVEM AERYV AFOJC AHWGJ AIXPE AJFER AKHYG ALMA_UNASSIGNED_HOLDINGS ALUEM AZZ BBABE CZZ DUGUG EBSCA ECOWB GEOUK HF4 IWG J-X JJU MYL PD6 PQQKQ PVBBV RYH WMAQA XI1 |
| ID | FETCH-LOGICAL-a57834-8489cce2f75cda2f349cddef678f327253f9f7a73eb1e06cc26d90e7411279fc3 |
| ISBN | 9789810247829 9810247826 |
| IngestDate | Sun Nov 30 03:44:15 EST 2025 Wed Dec 10 09:57:02 EST 2025 Thu Jun 26 23:01:13 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 2003266668 |
| LCCallNum_Ident | NON000000 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a57834-8489cce2f75cda2f349cddef678f327253f9f7a73eb1e06cc26d90e7411279fc3 |
| Notes | Includes bibliographical reference (p.285-304) and index |
| OCLC | 855898905 |
| PQID | EBC1681443 |
| PageCount | 322 |
| ParticipantIDs | askewsholts_vlebooks_9789812778222 proquest_ebookcentral_EBC1681443 nii_cinii_1130282270642226816 |
| PublicationCentury | 2000 |
| PublicationDate | c2002 2002 2002-09-16 |
| PublicationDateYYYYMMDD | 2002-01-01 2002-09-16 |
| PublicationDate_xml | – year: 2002 text: c2002 |
| PublicationDecade | 2000 |
| PublicationPlace | New Jersey ; Singapore |
| PublicationPlace_xml | – name: New Jersey ; Singapore – name: Singapore |
| PublicationYear | 2002 |
| Publisher | World Scientific World Scientific Publishing Company World Scientific Publishing |
| Publisher_xml | – name: World Scientific – name: World Scientific Publishing Company – name: World Scientific Publishing |
| SSID | ssj0000185540 |
| Score | 1.8895868 |
| Snippet | The 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... |
| SourceID | askewsholts proquest nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Computer algorithms Matching theory |
| TableOfContents | Intro -- Contents -- Preface -- 1 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 -- Bibliographic notes -- 2 Basic string searching algorithms -- 2.1 Knuth-Morris-Pratt algorithm -- 2.2 Boyer-Moore algorithm and its variations -- Bibliographic notes -- 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 -- Bibliographic notes -- 4 On-line construction of suffix trees -- 4.1 Tries and their compact versions -- 4.2 Prelude to Ukkonen algorithm -- 4.3 Ukkonen algorithm -- Bibliographic notes -- 5 More on suffix trees -- 5.1 Several applications of suffix trees -- 5.2 McCreight algorithm -- Bibliographic notes -- 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 -- Bibliographic notes -- 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 -- Bibliographic notes -- 8 Symmetries and repetitions in texts -- 8.1 Searching for symmetric words -- 8.2 Compositions of symmetric words -- 8.3 Searching for square factors -- Bibliographic notes -- 9 Constant-space searchings -- 9.1 Constant-space matching for easy patterns -- 9.2 MaxSuffix-Matching -- 9.3 Computation of maximal suffixes 17.4 Parameterized pattern matching -- 17.5 Breaking paragraphs into lines -- Bibliographic notes -- Bibliography -- Index 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 -- Bibliographic notes -- 10 Text compression techniques -- 10.1 Substitutions -- 10.2 Static Huffman coding -- 10.3 Dynamic Huffman coding -- 10.4 Factor encoding -- Bibliographic notes -- 11 Automata-theoretic approach -- 11.1 Aho-Corasick automaton -- 11.2 Determinizing automata -- 11.3 Two-way pushdown automata -- Bibliographic notes -- 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 -- Bibliographic notes -- 13 Matching by dueling and sampling -- 13.1 String matching by duels -- 13.2 String matching by sampling -- Bibliographic notes -- 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 -- Bibliographic notes -- 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 -- Bibliographic notes -- 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 -- Bibliographic notes -- 17 Miscellaneous -- 17.1 Karp-Rabin string matching by hashing -- 17.2 Shortest common superstrings -- 17.3 Unique-decipherability problem |
| Title | Jewels of stringology |
| URI | https://cir.nii.ac.jp/crid/1130282270642226816 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=1681443 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9789812778222&uid=none |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwELVo4QAXtiLKpghxjZTYTmwfoSogsQqx9Baljo3CkqKmQPl7xq6bFjggDlys2EoseSaZeTN-8SC0l8VcRZpRP9Ms8Kli0uemizOINXSXdrvSnjN7ys7PeacjLh2RtLTlBFhR8OFQvPyrqmEMlG1-nf2DuqtJYQCuQenQgtqh_YaIq67Dlupdjc5CNrU4ivsvCfOWLY01ZtWepcP8uVLp1cfAlee46z3At-6SW-NcAP6WCxjxb6xRsESjL7Gi4IAlKAACMTH9FSHvYD_iAEw4IzVUYzFEsbNH7YubkypdFYSGz-YOyZpMBXFu1YEQYiEtH8E2g90elOCsizz_4eKs375eQnXzL8cymlHFClocV7DwnEFbRY2RzLye9qZk1kC3h-3r1rHvCkX4aWQKhficciGlwppFMkuxJlRIsNsaPLEmmOGIaKFZygh4JhUYqniciUABmgoxE1qSNVQveoVaR56UDObhTMQio7FOOZFUpFJ2I0UCrXET7U4tMnl7spvaZTISC2YWcTXRNqw9kblpQ7M3DKPMxHqAdnkYN5E3lkpin3dM3KR90ArhBkrJxi9TbKL5yRuwheqD_qvaRnPybZCX_R2nvk-Jrg62 |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Jewels+of+stringology&rft.au=Crochemore%2C+Maxime&rft.au=Rytter%2C+Wojciech&rft.date=2002-01-01&rft.pub=World+Scientific&rft.isbn=9789810247829&rft.externalDocID=BA58976873 |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97898127%2F9789812778222.jpg |