Polynomial-time equivalences and refined algorithms for longest common subsequence variants

Bibliographic Information

Title
Polynomial-time equivalences and refined algorithms for longest common subsequence variants
Author
Asahiro Yuichi, Jansson Jesper, Lin Guohui, Miyano Eiji, Ono Hirotaka, Utahima Tadatoshi

Journal

Related Projects

See more

Details 詳細情報について

  • CRID
    1010298668225105792
  • Article Type
    journal article
  • Data Source
    • KAKEN

Report a problem

Back to top