Prospective Students   |   Current Students   |   Alumni   |   Industry & Government   |   Faculty Members
Username : Password : Forgot password?


3 Credit Hour Course

Prerequisite:   None

Introduction to Stringology: Notations, Problems and Naive Solutions, Motivations, Applications, Basic string searching algorithms; Data structures for String Matching: Suffix Tree, Suffix Array, Aho-Corasick Automaton, Applications of these data structures; Approximate Pattern Matching: Edit distance, Dynamic programming, Similarity measures for DNA and protein sequences, q-gram methods, Bit-parallel methods, Algorithms for degenerate/indeterminate strings; Sequence Analysis: Longest Common subsequence (LCS) Problem, Advanced Algorithms for LCS, Variants of LCS and algorithms; Text Compression: Shannon-Fano and Huffman codes, Arithmetic coding, Lempel-Ziv family of compression techniques, Burrows-Wheeler Transformation.

Department of Computer Science and Engineering, ECE building, Palashi, Dhaka, Bangladesh. The Department is part of the Faculty of Electrical and Electronic Engineering at the Bangladesh University of Engineering & Technology. No part or content of this website may be copied or reproduced without permission of the department authority. Contact with questions or comments on this page.  [Development Credits]