Back to Results
First PageMeta Content
Dynamic programming / Suffix tree / Analysis of algorithms / Suffix array / Longest common substring problem / Algorithm / Trie / String searching algorithm / Time complexity / Theoretical computer science / Mathematics / String


ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings Essam Mansour1
Add to Reading List

Document Date: 2011-09-28 10:12:24


Open Document

File Size: 999,19 KB

Share Result on Facebook

City

Istanbul / /

Company

P. / IBM / Computer Sciences / Intel / /

Country

Turkey / /

Currency

USD / CAD / /

/

Facility

Technology University / /

IndustryTerm

important algorithms / parallel computing resources / out-of-core algorithm / suffix tree construction algorithms / serial algorithms / construction algorithms / parallel construction algorithm / disk-based algorithms / shared-memory and shared-disk systems / shared-nothing systems / important suffix tree construction algorithms / particular applications / sharedmemory and shared-disk multi-core systems / search traversal / financial applications / ordinary multicore desktop systems / multicore systems / suffix tree construction algorithm / /

OperatingSystem

Linux / /

Organization

Engineering King Abdullah Univ. of Science and Technology Panos Kalnis1 Dept. of Computer Science / VLDB Endowment / Technology University of Peloponnese / /

Person

Abdullah Univ / /

Position

head / /

ProgrammingLanguage

L / C++ / /

Technology

51 Algorithm / 4.4 Algorithm / BuildSubTree algorithm / RAM / bioinformatics / Linux / 53 Algorithm / suffix tree construction algorithm / maintaining array I. The algorithm / important suffix tree construction algorithms / parallel construction algorithm / ComputeSuffixSubTree algorithm / virtual memory / using Algorithms / 52 Algorithm / existing suffix tree construction algorithms / human genome / existing construction algorithms / semi-disk-based algorithms / /

URL

http /

SocialTag