Back to search

Georgia Institute of Technology

Topics on the length of the longest common subsequences, with blocks, in binary random words

Abstract

dc:description.abstract

The study of LIn, the length of the longest increasing subsequences, and of LCIn, the length of the longest common and increasing subsequences in random words is classical in computer science and bioinformatics, and has been well explored over the last few decades. This dissertation studies a generalization of LCIn for two binary random words, namely, it analyzes the asymptotic behavior of LCbBn, the length of the longest common subsequences containing a fixed number, b, of blocks. We first prove that after proper centerings and scalings, LCbBn, for two sequences of i.i.d. Bernoulli random variables with possibly two different parameters, converges in law towards limits we identify. This dissertation also includes an alternative approach to the one-sequence LbBn problem, and Monte-Carlo simulations on the asymptotics of LCbBn and on the growth order of the limiting functional, as well as several extensions of the LCbBn problem to the Markov context and some connection with percolation theory.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Mathematics
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2019

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zhang, Yuze
Advisors dc:contributor.advisor
  • Houdré, Christian
  • Houdré, Christian
Committee members dc:contributor.committeemember
  • Foley, Robert
  • Koltchinskii, Vladimir
  • Damron, Michael
  • Tikhomirov, Konstantin
  • Hanson, Jack

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/62266

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Zhang, Yuze. Topics on the length of the longest common subsequences, with blocks, in binary random words. Doctoral thesis, Georgia Institute of Technology, 2019. http://hdl.handle.net/1853/62266