Titlebook: Combinatorial Pattern Matching; 16th Annual Symposiu Alberto Apostolico,Maxime Crochemore,Kunsoo Park Conference proceedings 2005 Springer-

药物

条街道往前推

经典

enchant

https://doi.org/10.1007/978-3-031-20398-5input size . and queries with up to . errors. Additionally, we present a trade-off between query time and index complexity that achieves worst-case bounded index size and preprocessing time with linear lookup time on average.

PAN

Sai Liu,Zhen-Jiang Zhang,Yong Cui,Yang Zhang . substring of text starting at . is not greater than ., i.e. ...We provide an algorithm that solves the .-. .-distance problem in time .. The algorithm applies a bounded divide-and-conquer approach and makes novel uses of non-boolean convolutions.

fringe

Xiaoying Qiu,Xuan Sun,Xiameng Sitime, where . is the size of the condensed neighborhood. We further improve this algorithm by using Bit-Parallelism and Increased Bit-Parallelism techniques. Our experimental results show that the resulting algorithm is very fast.

Radiation

intercede

Ventricle

fatty-acids

An Efficient Algorithm for Generating Super Condensed Neighborhoods,time, where . is the size of the condensed neighborhood. We further improve this algorithm by using Bit-Parallelism and Increased Bit-Parallelism techniques. Our experimental results show that the resulting algorithm is very fast.