Improved Lower Bounds on the Expected Length of Longest Common Subsequences
Published in arXiv (preprint), 2024
This paper has been accepted to the 2025 IEEE International Symposium on Information Theory, and was a result of the Major Qualifying Project of myself, Andrew Salls, and Chase Miller. You can find the preprint here, our full MQP report here, and an accompanying website we created for teaching and exploring the Longest Common Subsequence problem more generally here. This paper was the subject of a talk I gave at the Tufts University Discrete Math Seminar on August 8, 2024.