Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Finding optimal degenerate patterns in DNA sequences.

Bioinformatics (Oxford, England) - 1 Oct 2003

Shinozaki Daisuke, Akutsu Tatsuya, Maruyama Osamu

Abstract excerpt

MOTIVATION: The problem of finding transcription factor binding sites in the upstream regions of given genes is algorithmically an interesting and challenging problem in computational biology. A degenerate pattern over a finite alphabet Sigma is a sequence of subsets of Sigma. A string over IUPAC nucleic acid codes is also a degenerate pattern over Sigma = {A, C, G, T}, and is used as one of the major patterns...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Binding Sites
Share to Chromosome Mapping

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Protein Binding

Share to Regulatory Elements, Transcriptional

Share to Software

Share to Transcription Factors

Share to Transcription, Genetic

Source

Identifiers

PMID: 14534191
DOI: 10.1093/bioinformatics/btg1079

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Finding optimal degenerate patterns in DNA sequences.PMID 14534191Read ↗

Accurate recognition of cis-regulatory motifs with the correct lengths in prokaryotic genomes.Semantic proximity Read ↗

A mutation degree model for the identification of transcriptional regulatory elements.Semantic proximity Read ↗

STAR: an algorithm to Search for Tandem Approximate Repeats.Semantic proximity Read ↗

Nucleotide variation of regulatory motifs may lead to distinct expression patterns.Semantic proximity Read ↗

Quorum Planted Motif Discovery and Motif Finding Using S2f and Fff AlgorithmsSemantic proximity Read ↗

Floating search methodology for combining classification models for site recognition in DNA sequencesSemantic proximity Read ↗

Fast motif matching revisited: high-order PWMs, SNPs and indels.Semantic proximity Read ↗

Asymmetric Conservation within Pairs of Co-occurred Motifs Mediates Weak Direct Binding of Transcription Factors in ChIP-seq DataSemantic proximity Read ↗

Mining protein sequences for motifs.Semantic proximity Read ↗

Discovery of novel transcription factor binding sites by statistical overrepresentation.Semantic proximity Read ↗

DeepMotifSyn: a deep learning approach to synthesize heterodimeric DNA motifsSemantic proximity Read ↗

Kangaroo--a pattern-matching program for biological sequences.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.