StringologyTimes

Discovery Science for Stringologist

Discovery Science 2011

1. Scalable Detection of Frequent Substrings by Grammar-Based Compression.

Discovery Science 2010

1. Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.

Discovery Science 2008

1. String Kernels Based on Variable-Length-Don’t-Care Patterns.

Discovery Science 2005

1. Practical Algorithms for Pattern Based Linear Regression.

Discovery Science 2002

1. Discovering Best Variable-Length-Don’t-Care Patterns.

Discovery Science 2001

1. A Practical Algorithm to Find the Best Episode Patterns.

Discovery Science 2000

1. A Practical Algorithm to Find the Best Subsequence Patterns.

This site is open source. Improve this page.