Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification

Journal of Computational Biology

Volumn 7, Issue 3-4, 2000, Pages 345-362

  Marsan, L ^a   Sagot, M F ^a,b  

^a Université de Marne la Vallée   (France)

^b INSTITUT PASTEUR   (France)

Author keywords

Consensus; Model; Promoter and regulatory site; Structured motif extraction; Suffix tree

Indexed keywords

ALGORITHM; CONFERENCE PAPER; DNA DETERMINATION; DNA SEQUENCE; DNA STRUCTURE; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; PRIORITY JOURNAL; PROMOTER REGION; STRUCTURE ANALYSIS;

ALGORITHMS; BINDING SITES; COMPUTATIONAL BIOLOGY; CONSENSUS SEQUENCE; DNA, BACTERIAL; GENES, REGULATOR; GENOME, BACTERIAL; MODELS, GENETIC; PROMOTER REGIONS (GENETICS); SEQUENCE ANALYSIS, DNA;

BACTERIA (MICROORGANISMS);

EID: 0033677426     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652700750050826     Document Type: Conference Paper

References (37)

1. Selection of DNA binding sites by regulatory proteins. II. The binding specificity of cyclic AMP receptor protein to recognition sites
2. Generalized suffix trees for biological sequence data: Applications and implementations
3. Approaches to the automatic discovery of patterns in biosequences
4. Predicting gene regulatory elements in silico on a genomic scale
5. Expectation maximization algorithm for identifying protein-binding sites with variable lengths from unaligned DNA fragments
6. Cyclic AMP receptor protein: Role in transcription activation
7. Identification of common motifs in unaligned DNA sequences: Application to escherichia coli lrp regulon
8. Rigorous pattern-recognition methods for DNA sequences. Analysis of promoter sequences from Escherichia coli
9. Bacterial sigma factors
10. Compilation and analysis of Bacillus subtilis α-dependent promoter sequences: Evidence for extended contact between RNA polymerase and upstream promoter DNA
11. Patterns in DNA and amino acid sequences and their statistical significance
12. Functional promoter modules can be detected by formal models independent of overall nucleotide sequence similarity
13. An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
14. A space-economical suffix tree construction algorithm
15. Mycobacterial promoters
16. Non-canonical sequence elements in the promoter structure, cluster analysis of promoters recognized by Escherichia coli RNA polymerase
17. Improvements to a program for DNA analysis: A procedure to find homologies among many sequences
18. 70 promoters, and the kinetics of the steps of transcription initiation
19. Compound poisson and poisson process approximations for occurrences of multiple words in markov chains
20. Spelling approximate repeated or common motifs using a suffix tree
21. A double combinatorial approach to discovering patterns in biological sequences
22. A distance-based block searching algorithm
23. Multiple comparison: A peptide matching approach
24. Information content of binding sites on nucleotide sequences
25. Identifying protein-binding sites from unaligned DNA fragments
26. An exact method for finding short motifs in sequences, with application to the ribosome binding site problem
27. On-line construction of suffix-trees
28. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies
29. Discovering regulatory elements in non-coding sequences by analysis of spaced dyads
30. Promoter sequences and algorithmical methods for identifying them
31. 80 family of promoter signals
32. Models for prediction and recognition of eukaryotic promoters
33. Identification of functional elements in unaligned nucleic acid sequences by a novel tuple search algorithms