The p53MH algorithm and its application in detecting p53-responsive genes

DOI10.1073/PNAS.132268899zbMATH Open1033.92015OpenAlexW2017488005WikidataQ34064408 ScholiaQ34064408MaRDI QIDQ4547719FDOQ4547719

Authors:

Publication date: 11 September 2002

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: http://www.pnas.org/content/vol99/issue13/#APPLIED_MATHEMATICS

Recommendations

• An efficient algorithm for deciphering regulatory motifs
• A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites
• Whole genome human/mouse phylogenetic footprinting of potential transcription regulatory signals
• Evaluation of phylogenetic footprinting and its application for improved prediction of transcription factor binding sites
• Efficient identification of transcription factor binding sites with a graph theoretic approach

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Cited In (1)

• Faster pattern matching with character classes using prime number encoding

This page was built for publication: The p53MH algorithm and its application in detecting p53-responsive genes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547719)