Algorithms and complexity for annotated sequence analysis
| dc.contributor.author | Evans, Patricia Anne | |
| dc.contributor.supervisor | Fellows, Michael R. | |
| dc.contributor.supervisor | Ruskey, Frank | |
| dc.date.accessioned | 2017-12-14T22:45:38Z | |
| dc.date.available | 2017-12-14T22:45:38Z | |
| dc.date.copyright | 1999 | en_US |
| dc.date.issued | 2017-12-14 | |
| dc.degree.department | Department of Computer Science | en_US |
| dc.degree.level | Doctor of Philosophy Ph.D. | en_US |
| dc.description.abstract | Molecular biologists use algorithms that compare and otherwise analyze sequences that represent genetic and protein molecules. Most of these algorithms, however, operate on the basic sequence and do not incorporate the additional information that is often known about the molecule and its pieces. This research describes schemes to combinatorially annotate this information onto sequences so that it can be analyzed in tandem with the sequence; the overall result would thus reflect both types of information about the sequence. These annotation schemes include adding colours and arcs to the sequence. Colouring a sequence would produce a same-length sequence of colours or other symbols that highlight or label parts of the sequence. Arcs can be used to link sequence symbols (or coloured substrings) to indicate molecular bonds or other relationships. Adding these annotations to sequence analysis problems such as sequence alignment or finding the longest common subsequence can make the problem more complex, often depending on the complexity of the annotation scheme. This research examines the different annotation schemes and the corresponding problems of verifying annotations, creating annotations, and finding the longest common subsequence of pairs of sequences with annotations. This work involves both the conventional complexity framework and parameterized complexity, and includes algorithms and hardness results for both frameworks. Automata and transducers are created for some annotation verification and creation problems. Different restrictions on layered substring and arc annotation are considered to determine what properties an annotation scheme must have to make its incorporation feasible. Extensions to the algorithms that use weighting schemes are explored. schemes are explored. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/8864 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | Problem solving | en_US |
| dc.subject | Data processing | en_US |
| dc.subject | Algorithms | en_US |
| dc.subject | Computational complexity | en_US |
| dc.title | Algorithms and complexity for annotated sequence analysis | en_US |
| dc.type | Thesis | en_US |