{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/11286"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/11286","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Implementing Efficient Algorithms for Computing Runs","abstract":"<p>In the first part of this thesis we present a C++ implementation of an improved O(n log n) algorithm to compute runs, number of primitively rooted distinct squares, and maximal repetitions, based on Crochemore's partitioning algorithm. This is a joint work with Mei Jiang and extends her work on the problem. In the second part we present a C++ implementation of a linear algorithm to compute runs based on the Main's, and Kolpakov and Kucherov's algorithms following the strategy:</p> <p>1. Compute suffix array and LCP array in linear time;</p> <p>2. Using the suffix array and LCP array, compute Lempel-Ziv factorization in linear time;</p> <p>3. Using the Lempel-Ziv factorization, compute in linear time some of the runs that include all the leftmost runs following Main's algorithm;</p> <p>4. Using Kolpakov and Kucherov's approach, compute in linear time the rest of all the runs.</p> <p>For our linear time implementation, we partially relied on Jonathan Fischer's Java implementation.</p>","abstract_html":"&lt;p&gt;In the first part of this thesis we present a C++ implementation of an improved O(n log n) algorithm to compute runs, number of primitively rooted distinct squares, and maximal repetitions, based on Crochemore&#x27;s partitioning algorithm. This is a joint work with Mei Jiang and extends her work on the problem. In the second part we present a C++ implementation of a linear algorithm to compute runs based on the Main&#x27;s, and Kolpakov and Kucherov&#x27;s algorithms following the strategy:&lt;/p&gt; &lt;p&gt;1. Compute suffix array and LCP array in linear time;&lt;/p&gt; &lt;p&gt;2. Using the suffix array and LCP array, compute Lempel-Ziv factorization in linear time;&lt;/p&gt; &lt;p&gt;3. Using the Lempel-Ziv factorization, compute in linear time some of the runs that include all the leftmost runs following Main&#x27;s algorithm;&lt;/p&gt; &lt;p&gt;4. Using Kolpakov and Kucherov&#x27;s approach, compute in linear time the rest of all the runs.&lt;/p&gt; &lt;p&gt;For our linear time implementation, we partially relied on Jonathan Fischer&#x27;s Java implementation.&lt;/p&gt;","abstract_has_math":false,"creators":["Weng, Chia-Chun"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Franek, Frantisek","Antoine Deza, Emil Sekerinski"],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-10","date_published":"2011-10","updated_at":"2026-11-18T19:38:09Z","subjects":["run","repetition","periodicity","string","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/20105"],"render_values":[{"text":"https://doi.org/10.71548/20105","href":"https://doi.org/10.71548/20105","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/6266","7252","2253075"],"render_values":[{"text":"opendissertations/6266","href":null,"code":true},{"text":"7252","href":null,"code":true},{"text":"2253075","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/11286","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/11286","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F11286","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Franek, Frantisek","Antoine Deza, Emil Sekerinski"]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Weng, Chia-Chun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:54:09Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:54:09Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2011-09-23"]},{"key":"dc:date.issued","label":"Date","values":["2011-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["run","repetition","periodicity","string","Theory and Algorithms"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/6266","7252","2253075"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/11286","https://doi.org/10.71548/20105"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>In the first part of this thesis we present a C++ implementation of an improved O(n log n) algorithm to compute runs, number of primitively rooted distinct squares, and maximal repetitions, based on Crochemore's partitioning algorithm. This is a joint work with Mei Jiang and extends her work on the problem. In the second part we present a C++ implementation of a linear algorithm to compute runs based on the Main's, and Kolpakov and Kucherov's algorithms following the strategy:</p> <p>1. Compute suffix array and LCP array in linear time;</p> <p>2. Using the suffix array and LCP array, compute Lempel-Ziv factorization in linear time;</p> <p>3. Using the Lempel-Ziv factorization, compute in linear time some of the runs that include all the leftmost runs following Main's algorithm;</p> <p>4. Using Kolpakov and Kucherov's approach, compute in linear time the rest of all the runs.</p> <p>For our linear time implementation, we partially relied on Jonathan Fischer's Java implementation.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MSc)"]},{"key":"dc:title","label":"Title","values":["Implementing Efficient Algorithms for Computing Runs"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Franek, Frantisek","Antoine Deza, Emil Sekerinski"],"dc:contributor.department":["Computing and Software"],"dc:creator":["Weng, Chia-Chun"],"dc:date.accessioned":["2014-06-18T16:54:09Z"],"dc:date.available":["2014-06-18T16:54:09Z"],"dc:date.created":["2011-09-23"],"dc:date.issued":["2011-10"],"dc:description.abstract":["<p>In the first part of this thesis we present a C++ implementation of an improved O(n log n) algorithm to compute runs, number of primitively rooted distinct squares, and maximal repetitions, based on Crochemore's partitioning algorithm. This is a joint work with Mei Jiang and extends her work on the problem. In the second part we present a C++ implementation of a linear algorithm to compute runs based on the Main's, and Kolpakov and Kucherov's algorithms following the strategy:</p> <p>1. Compute suffix array and LCP array in linear time;</p> <p>2. Using the suffix array and LCP array, compute Lempel-Ziv factorization in linear time;</p> <p>3. Using the Lempel-Ziv factorization, compute in linear time some of the runs that include all the leftmost runs following Main's algorithm;</p> <p>4. Using Kolpakov and Kucherov's approach, compute in linear time the rest of all the runs.</p> <p>For our linear time implementation, we partially relied on Jonathan Fischer's Java implementation.</p>"],"dc:description.degree":["Master of Science (MSc)"],"dc:identifier.other":["opendissertations/6266","7252","2253075"],"dc:identifier.uri":["http://hdl.handle.net/11375/11286","https://doi.org/10.71548/20105"],"dc:subject":["run","repetition","periodicity","string","Theory and Algorithms"],"dc:title":["Implementing Efficient Algorithms for Computing Runs"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:38:09Z"}