Transcription factor binding sites prediction based on sequence similarity

Authors:
Jeong Seop Sim;Soo-Jun Park
Affiliations:
School of Computer Science and Engineering, Inha University, Incheon, Korea;Electronics and Telecommunications Research Institute, Daejeon, Korea
Venue:
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Year:
2006

Citing 5
Cited 0

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Trie-Based Data Structures for Sequence Assembly

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Space efficient linear time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequence algorithms are widely used to study genomic sequences in such fields as DNA fragment assembly, genomic sequence similarities, motif search, etc. In this paper, we propose an algorithm that predicts transcription factor binding sites from a given set of sequences of upstream regions of genes using sequence algorithms, suffix arrays and the Smith-Waterman algorithm.