Mohlo by sa vám tiež páčiť

Viac informácií o knihe Combinatorial Methods for String Processing

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 88 bodov

Anotácia knihy

Strings, or sequences, are the most fundamental form of digital data. Due to recent developments in sensor network technologies and semi-automated machine-to- machine (M2M) communications, sequential data have been increasing more rapidly than ever. It is o5en the case that such semi-automatically generated sequential data contain abundant repetitive structures. Thus, understanding, revealing, and utilizing combinatorial objects that reside in strings are of great significance in designing efficient string processing algorithms and data structures. Typical topics of interests include (but are not limited to): - Combinatorial string problems and solutions; - Pattern matching algorithms; - Applied combinatorics on words; - Text compression; - Data structures for strings, labeled trees, and compressed text. This Special Issue contains five peer-reviewed papers.

Parametre knihy

Zaradenie knihy Knihy po nemecky Naturwissenschaften, Medizin, Informatik, Technik Naturwissenschaften allgemein

• Celý názov: Combinatorial Methods for String Processing
• Autor: Shunsuke Inenaga
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 124
• EAN: 9783036521947
• ISBN: 3036521941
• ID: 38348980
• Nakladateľ: MDPI AG
• Hmotnosť: 481 g
• Rozmery: 244 × 170 × 11 mm
• Dátum vydania: 31. October 2021

---

---

---