✦ LIBER ✦

Data structures and algorithms for the string statistics problem

✍ Scribed by A. Apostolico, F. P. Preparata

Book ID: 120909448
Publisher: Springer
Year: 1996
Tongue: English
Weight: 863 KB
Volume: 15
Category: Article
ISSN: 0178-4617
DOI: 10.1007/BF01955046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved LP-based algorithms for the clo

Improved LP-based algorithms for the closest string problem

✍ F. Della Croce; F. Salassa 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Algorithms and data structures for flash

Algorithms and data structures for flash memories

✍ Gal, Eran; Toledo, Sivan 📂 Article 📅 2005 🏛 Association for Computing Machinery 🌐 English ⚖ 335 KB

Algorithms and data structures for flash

Algorithms and data structures for flash memories

✍ Gal, Eran; Toledo, Sivan 📂 Article 📅 2005 🏛 Association for Computing Machinery 🌐 English ⚖ 335 KB

Data structures and algorithms for tilin

Data structures and algorithms for tilings I

✍ Olaf Delgado-Friedrichs 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Based on the mathematical theory of Delaney symbols, data structures and algorithms are presented for the analysis and manipulation of generalized periodic tilings in arbitrary dimensions.

The Selective Fixing Algorithm for the c

The Selective Fixing Algorithm for the closest string problem

✍ Della Croce, Federico; Garraffa, Michele 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 235 KB

More Efficient Algorithms for Closest St

More Efficient Algorithms for Closest String and Substring Problems

✍ Ma, Bin; Sun, Xiaoming 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 215 KB