Suffix arrays: A new method for on-line string searches
صفحه : 16 زبان :  سال : 1991 میلادی حجم : 506.62 کیلوبایت رسته : رسته : 

سافیکس ارری ساختمان داده ای پیشرفته در زمینه کار با رشته ها

A new and conceptually simple data structure, called a suffix array, for on-line string searches is intro- duced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that, in practice, they use three to five times less space. From a complexity standpoint, suffix arrays permit on-line string searches of the type, ‘‘Is W a substring of A?’’ to be answered in time O(P + log N), where P is the length of W and N is the length of A, which is competitive with (and in some cases slightly better than) suffix trees. The only drawback is that in those instances where the underlying alphabet is finite and small, suffix trees can be constructed in O(N) time in the worst case, versus O(N log N) time for suffix arrays. However, we give an augmented algorithm that, regardless of the alphabet size, constructs suffix arrays in O(N) expected time, albeit with lesser space efficiency. We believe that suffix arrays will prove to be better in practice than suffix trees for many applications.


دانلود کتاب Suffix arrays: A new method for on-line string searches

download book Suffix arrays: A new method for on-line string searches



دانلود کتاب

Farnabaz چهارشنبه 13 مهر 1390 - 19:41 گزارش خطا

ارسال نظر

(If you're a human, don't change the following field)
Your first name.
محتویات این فیلد مخفی مانده و بصورت عمومی نمایش داده نمی شود.

آمار کتابخانه

  • کتاب های موجود: 1346
  • کتاب های صوتی: 24
  • کتاب های موبایل: 54
  • کتاب های فارسی: 813
  • کتاب های لاتین: 529