Are you sure you want to leave this community? Leaving the community will revoke any permissions you have been granted in this community.
Computational approaches for finding DNA regulatory motifs in promoter sequences are useful to biologists in terms of reducing the experimental costs and speeding up the discovery process of de novo binding sites. It is important for rule-based or clustering-based motif searching schemes to effectively and efficiently evaluate the similarity between a k-mer (a k-length subsequence) and a motif model, without assuming the independence of nucleotides in motif models or without employing computationally expensive Markov chain models to estimate the background probabilities of k-mers. Also, it is interesting and beneficial to use a priori knowledge in developing advanced searching tools.
Pubmed ID: 23282090
Publication data is provided by the National Library of Medicine ® and PubMed ®. Data is retrieved from PubMed ® on a weekly schedule. For terms and conditions see the National Library of Medicine Terms and Conditions.
Non-profit academic organization for research and services in bioinformatics. Provides freely available data from life science experiments, performs basic research in computational biology, and offers user training programme, manages databases of biological data including nucleic acid, protein sequences, and macromolecular structures. Part of EMBL.
View all literature mentionsA portal to biomedical and genomic information. NCBI creates public databases, conducts research in computational biology, develops software tools for analyzing genome data, and disseminates biomedical information for the better understanding of molecular processes affecting human health and disease.
View all literature mentions