𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Minimum Substring Cover problem

✍ Scribed by Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette


Book ID
113641781
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
239 KB
Volume
206
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the Common Substring Alignment Proble
✍ Gad M Landau; Michal Ziv-Ukelson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 164 KB

The Common Substring Alignment Problem is defined as follows: Given a set of one or more strings S 1 S 2 S c and a target string T , Y is a common substring of all strings S i , that is, S i = B i YF i . The goal is to compute the similarity of all strings S i with T , without computing the part of

The Minimum-Covering/Shortest-Path Probl
✍ John Current; Charles ReVelle; Jared Cohon 📂 Article 📅 1988 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 738 KB