Subsequences and Supersequences of Strings

Fraser, Campbell Bryce (1995) Subsequences and Supersequences of Strings. PhD thesis, University of Glasgow.

Abstract

Stringology - the study of strings - is a branch of algorithmics which been the sub-ject of mounting interest in recent years. Very recently, two books [M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1995] and [G. Stephen, String Searching Algorithms, World Scientific, 1994] have been published on the subject and at least two others are known to be in preparation. Problems on strings arise in information retrieval, version control, automatic spelling correction, and many other domains. However the greatest motivation for recent work in stringology has come from the field of molecular biology. String problems occur, for example, in genetic sequence construction, genetic sequence comparison, and phylogenetic tree construction. In this thesis we study a variety of string problems from a theoretical perspective. In particular, we focus on problems involving subsequences and supersequences of strings.

• Item Type: Thesis (PhD)
• Qualification Level: Doctoral
• Additional Information: Adviser: Rob Irving
• Keywords: Computer science
• Date of Award: 1995
• Depositing User: Enlighten Team
• Unique ID: glathesis:1995-74575
• Copyright: Copyright of this thesis is held by the author.
• Date Deposited: 13 Nov 2019 15:58
• Last Modified: 13 Nov 2019 15:58
• URI: https://theses.gla.ac.uk/id/eprint/74575