Motif search in DNA sequences using generalized suffix tree

Proceedings - 10th International Conference on Information Technology, ICIT 2007

Volumn , Issue , 2007, Pages 100-103

  Mohapatra, Anjali ^a   Mishra, P M ^b   Padhy, S ^c  

^a SIKSHA O ANUSANDHAN DEEMED TO BE UNIVERSITY   (India)

^b OMC Ltd   (India)

^c UTKAL UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BIO MOLECULES; BIOLOGICAL SEQUENCES; CHALLENGING PROBLEM; DRUG TARGET IDENTIFICATION; INTERNATIONAL CONFERENCES; MOTIF SEARCH; SEARCH SPACES; SUB TREES; SUFFIX TREES;

BOOLEAN FUNCTIONS; CHEMOTHERAPY; DATA STRUCTURES; DNA; DRUG DELIVERY; DRUG DOSAGE; FILE ORGANIZATION; GENES; INFORMATION TECHNOLOGY; NUCLEIC ACIDS; ORGANIC ACIDS; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

DNA SEQUENCES;

EID: 47349104640     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICOIT.2007.4418277     Document Type: Conference Paper

References (4)

1. A. N. Arslan, April 2005, Efficient approximate dictionary look-up over small alphabets, Technical Report CS-05-06, University of Vermont, Dept. of Comp. Sci.
2. D. Gusfield, 1997, Algorithms on strings, trees, and sequences: Computer science and computational biology, Cambridge University Press. 89-121
3. Elena Zheleva and A.N.Arslan, 2005, Fast motif search in protein sequence database, Department of Computer Science, University of Vermont.
4. Fred Glover and Lee Tangedahl, 1976, Dynamic Strategies for Branch and Bound, OMEGA, The Int. Jl. of Mgmt Sci., Vol. 4, No.5,. Pergamon Press.