Scalable Algorithms for String Kernels with Inexact Matching

@inproceedings{Kuksa2008ScalableAF,
  title={Scalable Algorithms for String Kernels with Inexact Matching},
  author={Pavel P. Kuksa and Pai-Hsi Huang and Vladimir Pavlovic},
  booktitle={NIPS},
  year={2008}
}
We present a new family of linear time algorithms for string comparison with mismatches under the string kernels framework. Based on sufficient statistics, our algorithms improve theoretical complexity bounds of existing approaches while scaling well in sequence alphabet size, the number of allowed mismatches and the size of the dataset. In particular, on large alphabets and under loose mismatch constraints our algorithms are several orders of magnitude faster than the existing algorithms for… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

53 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

and Inna Dubchak . Multi - class protein fold recognition using support vector machines and neural networks

  • Chris H. Q. Ding
  • In ICPR
  • 2008

Similar Papers

Loading similar papers…