header
Image from OpenLibrary

Distributed suffix array construction algorithms for biological data / Ahmed Mohamed Ibrahim Abdelhadi Metwally ; Supervised Ahmed M. Elbialy , Ahmed Hisham Kandil , Mohamed I. AbouElhoda

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Ahmed Mohamed Ibrahim Abdelhadi Metwally , 2014Description: 65 P. : plans , photographs ; 30cmOther title:
  • البناء الموزع لخوارزميات فهرس الخواتم فى البيانات البيولوجية [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Systems and Biomedical Engineering Summary: The suffix array introduced as a space-efficient substitute for a suffix tree, is an important fundamental data structure in string processing. Given a text T of length n, the suffix array of T is a lexicographically sorted list of all its suffixes, where the use of comparison-based sorting algorithms, e.g. radix sort, quick sort and merge sort, can be a natural solution, but has a time complexity of O(n²logn). Fortunately, researchers have noticed that the suffixes to be sorted are not completely independent, but have overlaps
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.03.M.Sc.2014.Ah.D (Browse shelf(Opens below)) Not for loan 01010110064549000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.13.03.M.Sc.2014.Ah.D (Browse shelf(Opens below)) 64549.CD Not for loan 01020110064549000

Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Systems and Biomedical Engineering

The suffix array introduced as a space-efficient substitute for a suffix tree, is an important fundamental data structure in string processing. Given a text T of length n, the suffix array of T is a lexicographically sorted list of all its suffixes, where the use of comparison-based sorting algorithms, e.g. radix sort, quick sort and merge sort, can be a natural solution, but has a time complexity of O(n²logn). Fortunately, researchers have noticed that the suffixes to be sorted are not completely independent, but have overlaps

Issued also as CD

There are no comments on this title.

to post a comment.