Extending pattern branching to handle challenging instances

Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIBE 2006

Volumn , Issue , 2006, Pages 65-69

  Davila, Jaime ^a   Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENOMIC INFORMATION; MOTIF SEARCH PROBLEM; PATTERN BRANCHING;

ALGORITHMS; BINDING SITES; TRANSCRIPTION FACTORS;

PATTERN MATCHING;

EID: 34547472459     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2006.253317     Document Type: Conference Paper

References (13)

1. J. Buhler and M. Tompa, Finding motifs using random projections, Proceedings Fifth Annual International Conference on Computational Molecular Biology (RECOMB), April 2001.
2. F Y.L. Chin and H C.M. Leung, Voting Algorithms for Discovering Long Motifs, Proceedings of the Third Asia-Pacific Bioinformatics Conference (APBC2005), Singapore, 261-271, January 2005.
3. J. Davila, S. Balla and S. Rajasekaran, Space And Time Efficient Algorithms for Planted Motif Search. Second International Workshop on Bioinformatics Research and Applications (IWBRA 2006), accepted, 2006.
4. J. Davila, S. Rajasekaran, An Efficient Branch and Bound Algorithm for Planted Motif Search. University of Connecticut BECAT/CSE Technical report. BECAT/CSE-TR-06-04. February 2006.
5. E. Eskin and P. Pevzner, Finding composite regulatory patterns in DNA sequences, Bioinformatics S1, 2002, pp. 354-363.
6. M., B. Ma and L. Wang. On the Closest String and Substring Problems. Journal of the ACM, Vol. 49, No. 2, March 2002, pp. 157-171.
7. P A. Evans, A. Smith. Toward Optimal Motif Enumeration.Proceedings of Algorithms and Data Structures, 8th International Workshop, WADS, 2003, pp. 47-58.
8. P A. Evans, A. Smith and H. Todd Wareham. On the complexity of finding common approximate substrings. Theoretical Computer Science 306, 2003, pp. 407-430.
9. P. Pevzner and S.-H. Sze, Combinatorial approaches to finding subtle signals in DNA sequences, Proc. Eighth International Conference on Intelligent Systems for Molecular Biology, 2000, pp. 269-278.
10. A. Price, S. Ramabhadran, P. Pevzner. 2003. Finding subtle motifs by branching from sample strings. Bioinformatics supplementary edition, Proceedings of the Second European Conference on Computational Biology (ECCB-2003).
11. S. Rajasekaran, S. Balla, and C.-H. Huang, Exact algorithms for the planted motif problem, Journal of Computational Biology, Oct 2005, Vol. 12, No. 8: 1117-1128.
12. S. Rajasekaran, Motif search algorithms, in Handbook of Computational Molecular Biology, CRC Press, 2005.
13. S. Sze, S. Lu, J. Chen, Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding. Algorithms in Bioinformatics: 4th International Workshop (WABI 2004), 2004.