Archives and Documentation Center
Digital Archives

First moment problem in longest common subsequences

Show simple item record

dc.contributor Graduate Program in Mathematics.
dc.contributor.advisor Işlak, Ümit.
dc.contributor.author Demirelli, Abdurrahman.
dc.date.accessioned 2023-03-16T11:21:44Z
dc.date.available 2023-03-16T11:21:44Z
dc.date.issued 2018.
dc.identifier.other MATH 2018 D46
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/15301
dc.description.abstract In this thesis, we investigate the properties of the longest common subsequences in random words, examine upper and lower bounds for the expected value of the longest common subsequences in this setting, and discuss the behavior of the asymptotic order of the longest common subsequences's variance. Besides this, we also study the relationship between longest common subsequences and longest increasing subsequences in random permutations and discuss some properties of the matrix L (n) that is generated by the length of the longest common subsequences of permutations. Our aim is to understand the details of the theory of the longest common subsequences whose study begun in 1970's, draw attention to the progress about the longest common subsequences in the recent studies, and state some open problems about the subject
dc.format.extent 30 cm.
dc.publisher Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 2018.
dc.subject.lcsh Sequential machine theory.
dc.subject.lcsh Sequences (Mathematics)
dc.title First moment problem in longest common subsequences
dc.format.pages ix, 45 leaves ;


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital Archive


Browse

My Account