Type:

Other

Description:

This module will introduce the suffix tree data structure and its many applications in string matching and bioinformatics, describe how suffix trees are built on a serial computer, discuss the challenges associated with building the tree in parallel, explain one application in bioinformatics (pattern matching) that uses suffix tree, develop a method to implement pattern matching on a distributed memory parallel computer, and describe how to analyze parallel performance and identify improvements.

Subjects:

  • Computer Science > General
  • Education > General
  • Mathematics > General

Education Levels:

  • Grade 1
  • Grade 2
  • Grade 3
  • Grade 4
  • Grade 5
  • Grade 6
  • Grade 7
  • Grade 8
  • Grade 9
  • Grade 10
  • Grade 11
  • Grade 12

Keywords:

Informal Education,Higher Education,NSDL,Undergraduate (Upper Division),Computational Science,Undergraduate (Lower Division),Graduate/Professional,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-055,oai:nsdl.org:2200/20120711190000008T,Vocational/Professional Development Education,Mathematics,Education,General Public,Computing and Information,Computer Science

Language:

English

Access Privileges:

Public - Available to anyone

License Deed:

Creative Commons Attribution Non-Commercial Share Alike

Collections:

None
This resource has not yet been aligned.
Curriki Rating
'NR' - This resource has not been rated
NR
'NR' - This resource has not been rated

This resource has not yet been reviewed.

Not Rated Yet.

Non-profit Tax ID # 203478467