Mohlo by se vám také líbit

Více informací o knize Combinatorial Methods for String Processing

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 88 bodů

Anotace 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.

Parametry knihy

Zařazení knihy Knihy v němčině Naturwissenschaften, Medizin, Informatik, Technik Naturwissenschaften allgemein

• Plný název: Combinatorial Methods for String Processing
• Autor: Shunsuke Inenaga
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 124
• EAN: 9783036521947
• ISBN: 3036521941
• ID: 38348980
• Nakladatelství: MDPI AG
• Hmotnost: 481 g
• Rozměry: 244 × 170 × 11 mm
• Datum vydání: 31. October 2021

---

---

---