Sequence alignment using the seeding heuristics method

Simple item page
dc.contributor.authorOyekanmi, Adedoyin
dc.date.accessioned2023-11-17T07:23:31Z
dc.date.available2023-11-17T07:23:31Z
dc.date.issued2022
dc.descriptionA dissertation submitted in fulfilment of the requirements for the degree of Master of Science to the Faculty of Science, University of the Witwatersrand, Johannesburg, 2022
dc.description.abstractIn this dissertation, we studied Guillaume J. Filion’s paper on utilizing analytic combinatorics to calculate the probability that a read of size (s = k) has no seed (P(S)). First, we computed the weighted generating functions of all reads and reads that have no seed by constructing sequences of combinatorial objects using transfer graphs and transfer matrices as formulated by Filion. Then, we extended his logic to calculate the probability that a seed is present in a read (1 − P(S)) by singularity analysis, after obtaining the probability that a read has no seed. This involved extracting coefficients of weighted generating functions and solving complex polynomials which is the analytic combinatorics approach. Finally, we use recurrence approach (on Mathematica) to find more precise probabilities than what was provided by Filion for some practical examples.
dc.description.librarianPC(2023)
dc.facultyFaculty of Science
dc.identifier.urihttps://hdl.handle.net/10539/37026
dc.language.isoen
dc.schoolMathematics
dc.subjectSeeding heuristics method
dc.subjectSequence alignment
dc.titleSequence alignment using the seeding heuristics method
dc.typeDissertation
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Oyekanmi_2260391_MscDissertation_Final.pdf
Size:
2.2 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.43 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
ETD Collection