Matching for run-length encoded strings

Alberto Apostolico, Gad M. Landau, Steven Skiena

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)4-16
Number of pages13
JournalJournal of Complexity
Issue number1
StatePublished - Mar 1999

Bibliographical note

Funding Information:
* Work supported in part by NSF Grants CCR-9201078 and CCR-9700276, by NATO Grant CRG 900293, by British Engineering and Physical Sciences Research Council Grant GR L19362, by the National Research Council of Italy, and by the ESPRIT III Basic Research Programme of the EC under Contract 9072 (Project GEPPCOM). -Work supported in part by NSF Grants CCR-9305873 and CCR-9610238. This work is partially supported by ONR Award 431-0857A and NSF Grant CCR-9625669.

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Statistics and Probability
  • Numerical Analysis
  • General Mathematics
  • Control and Optimization
  • Applied Mathematics

Cite this