String Inference and (non)Lexicographic Ordering

Speaker:  M. Sohel Rahman – Dhaka, Bangladesh
Topic(s):  Computational Theory, Algorithms and Mathematics


In this lecture we will discuss two interesting but possibly less studied topics from string combinatorics. We will divide the talk into two parts. In the first part, we will briefly present different combinatorics and algorithmic results on lexicographic string ordering with a goal to introduce and discuss some non-lexicographic ordering and relevant results. In the second part, we will focus on another area where the goal is to infer strings from a given data structure. Stringology literature has been enriched by numerous efficient data structures. We will discuss some interesting results and algorithms to infer strings from some of these.

About this Lecture

Number of Slides:  120
Duration:  60 minutes
Languages Available:  English
Last Updated: 

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.