Author of the publication

A fast algorithm for the generalized k-keyword proximity problem given keyword offsets.

, , and . Inf. Process. Lett., 91 (3): 115-120 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Transformation of Suffix Arrays into Suffix Trees on the MPI Environment., , and . RSFDGrC, volume 4482 of Lecture Notes in Computer Science, page 248-255. Springer, (2007)A fast algorithm for the generalized k-keyword proximity problem given keyword offsets., , and . Inf. Process. Lett., 91 (3): 115-120 (2004)A simple pattern matching algorithm for weighted sequences.. RACS, page 65-67. ACM, (2012)Finding overlaps within regular expressions with variable-length gaps., , and . RACS, page 16-21. ACM, (2013)Linear Time Algorithm for the Generalised Longest Common Repeat Problem., and . SPIRE, volume 3772 of Lecture Notes in Computer Science, page 191-201. Springer, (2005)REduce: Removing Redundancy from Regular Expression Matching in Network Security., , , and . ICCCN, page 1-10. IEEE, (2015)A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem., and . ICANNGA (1), volume 4431 of Lecture Notes in Computer Science, page 554-561. Springer, (2007)Approximate Function Matching under δ- and γ- Distances., , and . SPIRE, volume 7608 of Lecture Notes in Computer Science, page 348-359. Springer, (2012)delta-gamma-Parameterized Matching., , and . SPIRE, volume 5280 of Lecture Notes in Computer Science, page 236-248. Springer, (2008)Finding Patterns with Variable Length Gaps or Don't Cares., , , , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 146-155. Springer, (2006)