Strings are very simple yet very applicable data structures. Their applicability ranges from modelling DNA, to modelling protein sequences, to information retrieval, to web page searches, and many more. Due to their simplicity, there are few structural properties that could be exploited for analysis of string algorithms and their auxiliary data structures. Thus, from the beginning, researchers paid utmost attention to periodic properties of strings, such as runs which are maximal fractional periodicities.Though first conjectured in 1999 by Kolpakov and Kucherov, the runs conjecture that there are fewer runs than the length of the string was only settled in 2015 by Bannai et al. via specific Lyndon roots referred to as L-roots. This method allows mapping of runs to the starting points of its L-roots that form mutually disjoint subsets of the indices of the string. This relationship between runs and maximal Lyndon factors (substrings) of a string is not coincidental, as Bannai et al. used the knowledge of all maximal Lyndon factors with respect to an order and its inverse to compute all runs in linear time. Thus, computing the all maximal Lyndon factors efficiently becomes of importance. In this thesis, we review the fundamental properties of Lyndon strings,including the famous Lyndon factorization and its linear solution due to Duval. In addition to that we explore a new and conceptually simple data structure called Lyndon array and its relationship to the suffix array. Finally, we discuss 2015 Baier's algorithm for sorting suffixes that identifies and sorts in phase 2 the maximal Lyndon factors in O(log ∑)steps for a string of length n over an alphabet ∑. We examine the fact that Baier's algorithm sorts the suffixes by sorting the maximal Lyndon factors, and present a different, potentially faster algorithm for phase 2. Our goal was to gather all the relevant well known and some unpublished facts about Lyndon strings and their relationship to runs. In addition we present a novel O(n log(n)) recursive algorithm for computing Lyndon arrays that may be competitive with Baier's for strings with large alphabets. / Thesis / Doctor of Philosophy (PhD)

Thesis (M.A.)--Southwest Texas State University, 1993. / Includes bibliographical references (leaves 99-108).

Thesis (Ph. D.)--University of Washington, 1989. / Vita. Includes bibliographical references (leaves [439]-452).

Thesis (Ph. D.)--University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 196-212). Available also in a digital version from Dissertation Abstracts.

There are at least two reasons to have an efficient algorithm for identifying all maximal Lyndon substrings in a string: first, in 2015, Bannai et al. introduced a linear algorithm to compute all runs in a string that relies on knowing all maximal Lyndon substrings of the input string, and second, in 2017, Franek et al. showed a linear co-equivalence of sorting suffixes and sorting maximal Lyndon substrings of a string (inspired by a novel suffix sorting algorithm of Baier). In 2016, Franek et al. presented a brief overview of algorithms for com- puting the Lyndon array that encodes the knowledge of maximal Lyndon substrings of the input string. It discussed four different algorithms. Two known algorithms for computing the Lyndon array: a quadratic in-place algorithm based on iterated Duval’s algorithm for Lyndon factorization and a linear algorithmic scheme based on linear suffix sorting, computing the inverse suffix array, and applying the NSV (Next Smaller Value) algorithm. The overview also discusses a recursive version of Duval’s algorithm with a quadratic complexity and an algorithm emulating the NSV approach with a possible O(n log(n)) complexity. The authors at that time did not know of Baier’s algorithm. In 2017, Paracha proposed in her Ph.D. thesis an algorithm for the Lyndon array. The proposed algorithm was interesting as it emulated Farach’s recursive approach for computing suffix trees in linear time and introduced τ-reduction; which might be of independent interest. This was the starting point of this Ph.D. thesis. The primary aim is: (a) developing, analyzing, proving correct, and implementing in C++ a linear algorithm for computing the Lyndon array based on Baier’s suffix sorting; (b) analyzing, proving correct, and implementing in C++ the algorithm proposed by Paracha; and (c) empirically comparing the performance of these two algorithms with the iterative version of Duval’s algorithm. / Dissertation / Doctor of Philosophy (PhD)

Thesis (M.A.)--Southwest Texas State College, 1967. / Includes bibliographical references (leaves 189-193).

This thesis examines the nature and the extent of American economic power and influence in the 1960s in the context of the Anglo-American economic relationship. It also seeks to provide an insight into the workings of 'special relationship' between Britain and the United States in the economic realm. Finally, this examination attempts to establish the veracity of new more positive historical interpretations of the foreign policy of President Lyndon Johnson. The study argues that American economic power was not waning, as was previously suggested by some historians. It reveals that the Johnson Administration was able to use its financial assistance for sterling to extract significant concessions from the British government in its domestic economic policies. Indeed, the thesis demonstrates that the United States played a significant role in the formulation of British economic policy. The existence of transgovernmental networks between actors and agencies were instrumental in enabling the Johnson Administration to influence the policies of the British government. Moreover, this study contends that many of the most important decisions of the Labour government relating to monetary policy and the sterling exchange rate were influenced by considerations for the views of the United States. It concludes that the 'special relationship' was determined not by sentiment or shared culture, but largely by community of interest. Finally, the thesis concurs in and further develops the emerging positive revisionist interpretation of the European policy of President Johnson.

Thesis (Ph. D.)--George Washington University, 1982. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 287-293).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1975. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

The Canterbury Region is susceptible to a variety of natural hazards, including earthquakes, landslides and climate hazards. Increasing population and tourism within the region is driving development pressures and as more and more development occurs, the risk from natural hazards increases. In order to avoid development occurring in unacceptably vulnerable locations, natural hazard assessments are required. This study is a reconnaissance natural hazard assessment of Lakes Lyndon, Coleridge and Tekapo. There is restricted potential for development at Lake Lyndon, because the land surrounding the lake is owned by the Crown and has a number of development restrictions. However, there is the potential for conservation or recreation-linked development to occur. There is more potential for development at Lake Coleridge. Most of the land surrounding the lake is privately owned and has less development restrictions. The majority of land surrounding Lake Tekapo is divided into Crown-owned pastoral leases, which are protected from development, such as subdivision. However, there are substantial areas around the lake, which are privately owned and, therefore, have potential for development. Earthquake, landslide and climate hazards are the main natural hazards threatening Lakes Lyndon, Coleridge and Tekapo. The lakes are situated in a zone of active earth deformation in which large and relatively frequent earthquakes are produced. A large number of active faults lie within 15 km of each lake, which are capable of producing M7 or larger earthquakes. Ground shaking, liquefaction, landslides, tsunami and seiches are among the consequences of earthquakes, all of which have the potential to cause severe damage to lives, lifelines and infrastructure. Landslides are also common in the landscape surrounding the lakes. The majority of slopes surrounding the lakes are at significant risk from earthquake-induced failure under moderate to strong earthquake shaking. This level of shaking is expected to occur in any 50 year period around Lakes Lyndon and Coleridge, and in any 150 year period around Lake Tekapo. Injuries, fatalities and property damage can occur directly from landslide impact or from indirect effects such as flooding from landslide-generated tsunami or from landslide dam outbreaks. Lakes Lyndon, Coleridge and Tekapo are also susceptible to climate hazards, such as high winds, drought, heavy snowfall and heavy rainfall, which can lead to landslides and flooding. Future climate change due to global warming is most likely going to affect patterns of frequency and magnitudes of extreme weather events, leading to an increase in climate hazards. Before development is permitted around the lakes, it is essential that each of these hazards is considered so that unacceptably vulnerable areas can be avoided.