✦ 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
DOI: 10.1016/j.ic.2008.06.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Minimum Covering Sphere Problem

✍ Elzinga, D. J.; Hearn, D. W. 📂 Article 📅 1972 🏛 INFORMS 🌐 English ⚖ 557 KB

The minimum-entropy set cover problem

✍ Eran Halperin; Richard M. Karp 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Minimum-diameter covering problems

✍ Esther M. Arkin; Refael Hassin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

On the Common Substring Alignment Proble

On the Common Substring Alignment Problem

✍ 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

The Minimum-Covering/Shortest-Path Problem

✍ John Current; Charles ReVelle; Jared Cohon 📂 Article 📅 1988 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 738 KB

The Probabilistic Minimum Vertex-coverin

The Probabilistic Minimum Vertex-covering Problem

✍ Cécile Murat; Vangelis Th. Paschos 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB