✦ LIBER ✦

A polynomial-time algorithm for computing characteristic strings under a set of strings

✍ Scribed by Minoru Ito; Kuniyasu Shimizu; Michio Nakanishi; Akihiro Hashimoto

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing a longest common subsequence f

✍ W. J. Hsu; M. W. Du 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 832 KB

A work-time optimal algorithm for comput

✍ Costas S. Iliopoulos; Kunsoo Park 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 851 KB

A simple computational model for classif

✍ Yoshihiko Suhara; Akito Sakurai 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Quadratic-time algorithm for a string co

✍ Sebastian Deorowicz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 117 KB

An asymptotically superior algorithm for

✍ Krishna, H. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 225 KB

Fast, Practical Algorithms for Computing

✍ Simon J. Puglisi; W. F. Smyth; Munina Yusufu 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 1024 KB