Algorithm Engineering „Suffix-Bäume und Suffix-Arrays“

For a fair comparison, we therefore measured the total running time, and the time for matching the PSSMs (without suffix tree construction). This allows to use the same enhanced

This study contributes to the understanding of morphological effects in auditory word recognition in three ways: First, we introduce a new uniqueness point measure which accounts

On balance, -In appears to be the most effective means of such marking, not least in its plural form -Innen where the problem of article use is absent.. Nevertheless, a look at

47 Ein weiterer starker Impuls von Seiten der Soziologie ist mit Norbert Elias’ Arbeit zur ‚höfischen Gesellschaft‘ zu fas- sen, dessen Analyse des französischen Schlossbaus seine

Suffix-B¨aume: Tries, Suffix-Tries, Naiver Algorithmus, Laufzeitanalyse, Potentielle Gr¨oße von Suffix-Tries; Suffix-Links, Online Algorithmus f¨ur. Suffix-Tries und

In der Einleitung seines Buches bedauert Adler: „Die Zeit liegt nicht weit zurück, in der ein theoretisches Bemühen um die Grundlagen der Baukunst zu den verpönten Dingen gehörte, zu

The number of distinct strings composed of exactly k different characters sharing a suffix array P with d R + -descents was given in Theorem 4.6.. All these strings are

Whenever the data necessary for the construction by the clustered algorithm completely fits into main memory and the string is too large for Ukkonen’s algorithm, the clustered