Sublinear-Time Algorithms for Computing and Embedding Gap Edit Distance

Sublinear-Time Algorithms for Computing and Embedding Gap Edit Distance

Explore cutting-edge research on sublinear-time algorithms for computing and embedding gap edit distance in this 20-minute IEEE conference talk. Delve into the work of Tomasz Kociumaka from Bar-Ilan University and Barna Saha from the University of California, Berkeley, as they present their findings on efficient methods for calculating and representing edit distances with gaps. Gain insights into the latest advancements in algorithmic techniques that have potential applications in areas such as computational biology, natural language processing, and data analysis.