External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Longest Filled Common Subsequence Problem

Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis. The Longest Filled Common Subsequence Problem. In Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter, editors, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. Volume 78 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Authors

Mauro Castelli

This author has not been identified. Look up 'Mauro Castelli' in Google

Riccardo Dondi

This author has not been identified. Look up 'Riccardo Dondi' in Google

Giancarlo Mauri

This author has not been identified. Look up 'Giancarlo Mauri' in Google

Italo Zoppis

This author has not been identified. Look up 'Italo Zoppis' in Google
runs on