Related Experiment Video
Updated: Jan 8, 2026

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
Published on: April 13, 2022
A simple grammar-based index for finding approximately longest common substrings
Travis Gagie1,2, Sana Kashgouli1, Gonzalo Navarro3,2
1Faculty of Computer Science, Dalhousie University, Halifax, Canada.
Abstract:
We show how, given positive constants and , and an -balanced straight-line program with rules for a text , we can build an -space index that, given a pattern , in time finds w.h.p. a substring of that occurs in and whose length is at least a ( ) fraction of the longest common substring of and . The correctness can be ensured within the same expected query time.
Related Concept Videos
Lagging Strand Synthesis
Lagging Strand Synthesis
There are several major differences between synthesis of the leading strand and synthesis of the lagging strand. 1) Leading strand synthesis happens in the direction of replication fork opening, whereas lagging strand synthesis happens in the...
Nomenclature of Alkenes
As per the IUPAC rules, the longest carbon chain containing the maximum number of double bonds is identified as the parent chain and is numbered such that the doubly bonded carbon atoms receive the lowest possible numbers. The location of the double bond is indicated by the number of its first carbon atom. In branched...
Functional Groups
Long-patch Base Excision Repair
Pre-mRNA Processing: RNA Splicing

