What is nucleotide counting?

DNA is made of four nucleotide bases:

• A — Adenine
• T — Thymine
• G — Guanine
• C — Cytosine

Nucleotide counting tells you how many times each base occurs in a DNA sequence.

Why is it useful?

Counting bases is one of the simplest ways to analyze a DNA sequence. It provides basic information that can be used to calculate GC content, compare sequences, and perform quality checks.

How does it work?

Example:

Algorithm

1. Clean the input: strip the FASTA header line (if any), remove line breaks, and uppercase the sequence.
2. Count each base independently: scan the cleaned sequence once per base type (A, C, G, T) and tally occurrences.
3. Build the outputs: populate the dictionary-style summary and the results table from the same four counts.

Pseudocode

Implementation Details

• Four independent scans: the running tool counts each base with its own regular-expression match rather than a single pass that increments a shared tally, since sequences here are short enough that the simpler four-scan approach is fast and easy to read.
• Character validation: cleanInput() strips anything outside A, T, C, G, N before counting, so unexpected characters are silently removed rather than causing an error.
• Ambiguous base N: an N base still counts toward the total sequence length shown elsewhere in the app, but it is not tallied under A, C, G, or T, so the four displayed counts can sum to less than the total length when N bases are present.

What is transcription?

Transcription is the process of making an RNA sequence from DNA. In RNA, uracil (U) takes the place of thymine (T); the other three bases (A, C, G) stay the same.

What do 5′ and 3′ mean?

A DNA or RNA strand has two different ends. This means the molecule has a direction, like a one-way street.

The direction is labeled 5′ (pronounced "five prime") at one end and 3′ ("three prime") at the other.

Each nucleotide is built around a sugar ring with numbered carbons. At the 5′ end, the first sugar's phosphate group sticks out. That phosphate sits on the sugar's 5th carbon, so this end is called the 5′ end. At the 3′ end, the last sugar added has an exposed hydroxyl group. That hydroxyl sits on the sugar's 3rd carbon, so this end is called the 3′ end.

Direction matters in biology. DNA replication and transcription only run one way along the strand, from 5′ to 3′, never backwards. That's why you'll find strands in this app labeled with their direction. It's not decoration; it shows which way the underlying process reads or builds the molecule.

DNA has two strands — which one does the cell actually read?

DNA is double-stranded. The strand you paste into this tool is the coding strand (also called the sense strand) — by convention, written 5′→3′, and it reads almost identically to the RNA that gets produced. But that is not the strand RNA polymerase actually reads.

RNA polymerase reads the other strand, the template strand (antisense strand), running in the opposite direction (3′→5′), and builds RNA by pairing a complementary base against each template base, growing the new RNA 5′→3′.

Read down each column: the template base is the DNA complement of the coding base above it (A↔T, C↔G). The RNA base is then built by pairing against the template using DNA→RNA rules (template A pairs with RNA U, template T pairs with RNA A, template C pairs with RNA G, template G pairs with RNA C).

Why the result always matches "just swap T for U"

Follow one column all the way through: complementing a coding base to get the template base, then complementing the template base again to get the RNA base, is two complements in a row — and complementing twice cancels out. The only base where that cancellation doesn't return the original letter is T, because DNA has no U: T's DNA complement is A, and A's DNA→RNA pairing partner is U. So the net effect, column by column, is always: T becomes U, and A, C, and G pass straight through unchanged.

The interactive visualization below shows all three strands explicitly, so you can see the full mechanism in action.

Why is it useful?

Cells use RNA as an intermediate step between DNA and protein production. Understanding transcription is essential for understanding the central dogma of molecular biology:

Algorithm

1. Clean the input: strip the FASTA header line (if any), remove line breaks, and uppercase the sequence. This is treated as the coding (sense) strand, 5′→3′, matching every other tool in this suite.
2. Derive the template strand (shown in the visualization): complement each coding base (A↔T, C↔G) to get the antisense strand the cell actually reads, conventionally labeled 3′→5′.
3. Derive the RNA strand from the template: complement each template base again, using DNA→RNA pairing (template A→U, T→A, C→G, G→C), producing RNA 5′→3′.
4. Simplify: since steps 2 and 3 are two complements in a row, they algebraically reduce to a single substitution: replace every T with U, leave A/C/G unchanged. The implementation computes this directly rather than building the template strand as an intermediate step, since the two approaches are mathematically guaranteed to agree.
5. Report statistics: compare original and transcribed lengths and count how many substitutions were made.

Pseudocode

Full mechanism (what actually happens biologically, and what the visualization below renders):

Equivalent shortcut (what the tool actually computes, proven identical to the full mechanism above for every base):

Implementation Details

• Single substitution pass: the tool performs one replaceAll('T', 'U') call on the coding strand rather than materializing an intermediate template strand, since the two are proven equivalent above.
• Length is always preserved: transcription is a one-to-one base substitution, so the RNA output is always exactly the same length as the cleaned DNA input.
• Coding strand convention: like every other tool in this suite (Complement, ORF Analysis, Motif Finder), the pasted sequence is treated as the coding strand, 5′→3′. The template strand is derived for display purposes only, on demand, in the interactive visualization below — it is not what the input is assumed to already be.

What is a complementary DNA strand?

DNA has two strands whose bases pair according to specific rules:

The complement of a DNA sequence replaces every base with its partner.

Why is it useful?

Complementary base pairing is fundamental to DNA replication, sequencing, molecular biology experiments, and many bioinformatics algorithms.

How does it work?

The algorithm is simply:

What do 5′ and 3′ mean?

DNA and RNA strands have a direction, like a one-way street. One end is called 5′ ("five prime") and the other 3′ ("three prime"), named after which carbon of the sugar ring is exposed at that end.

The two paired strands of a DNA double helix always run in opposite directions. If one strand reads 5′→3′ left to right, its partner reads 3′→5′ left to right. Biologists call this antiparallel.

This is exactly why complement and reverse complement are different operations below. A straight complement keeps the original left-to-right order. But that doesn't match the other strand's own natural reading direction. Reversing it does.

Important distinction: Complement ≠ Reverse Complement

Complement:

Reverse complement:

A reverse complement first finds the complement and then reverses the result.

Algorithm

1. Clean the input: strip the FASTA header, remove whitespace, and uppercase the sequence.
2. Compute the direct complement: map every base through the A↔T, C↔G pairing table, in the original order.
3. Compute the reverse complement: reverse the direct-complement string.
4. Report pairing statistics: count A-T pairs and G-C pairs across the original sequence.

Pseudocode

Implementation Details

• Complement-then-reverse order: the tool always builds the direct complement first and reverses that result to get the reverse complement, rather than reversing first. Both orders are mathematically equivalent for this operation.
• Shared helper: the same BASE_COMPLEMENT map and the equivalent of a getReverseComplement() pattern used here are reused by the Motif Finder and ORF Analysis tools elsewhere in this app.
• Ambiguous base N: an N base maps to itself in the complement, since its identity is unknown.

What is translation?

Translation is the process of converting an RNA sequence into an amino-acid sequence. The ribosome reads RNA in groups of three nucleotides called codons.

Why is it useful?

Proteins perform most of the structural and functional work inside cells. Translation lets us predict the protein sequence encoded by an RNA sequence.

How does it work?

Example:

Each codon corresponds to an amino acid.

Some codons signal stop rather than an amino acid:

Start codon

The standard start codon is:

It can signal where translation begins.

Do all organisms use every codon equally?

Most amino acids can be written by more than one codon. For example, leucine has six. But real organisms don't pick between them at random. Each species has favorite codons, and the favorites differ from one species to the next. This is called codon usage bias.

The tool on this page always translates with the same standard genetic code, so the protein it gives you doesn't depend on the organism. The table below is here as a reference, so you can see how differently real organisms use the same code.

Algorithm

1. Clean and normalize the input: strip the FASTA header and whitespace, uppercase the sequence, and convert U back to T so the codon lookup can reuse the DNA-based codon table.
2. Read codons from position 0: take consecutive non-overlapping 3-base windows starting at the very first base of the input, with no search for a start codon.
3. Translate each codon: look up the corresponding amino acid in the standard codon table.
4. Stop at the first stop codon: once a codon translates to "Stop," translation ends immediately and that codon is excluded from the protein.
5. Report statistics: sequence length, codons processed, and final protein length.

Pseudocode

Implementation Details

• No start-codon search: unlike the ORF Analysis tools, this translator does not look for AUG/ATG before translating. It reads from position 0 of whatever sequence you enter, so the input is expected to already begin at the intended reading frame.
• Shared codon table: the RNA input is converted to its DNA-letter equivalent internally and looked up against the same STANDARD_CODON_TABLE used by the ORF Analysis tools, rather than maintaining a separate RNA-specific table.
• Trailing partial codon: the loop condition only processes complete 3-base groups, so 1–2 leftover bases at the end of the sequence (if the length isn't a multiple of 3) are silently ignored rather than flagged.
• No stop codon means no truncation: if the input never reaches an in-frame stop codon, translation simply continues until it runs out of complete codons.

What is GC content?

GC content is the percentage of bases in a DNA sequence that are either Guanine (G) or Cytosine (C). The formula is:

Why is it useful?

GC content provides information about the composition of a DNA sequence. It is useful when comparing sequences and can affect properties such as DNA stability and experimental behavior.

How does it work?

Example:

Count:

Therefore:

Visual explanation

Algorithm

1. Split the FASTA dataset: break the input into individual records wherever a line starts with >.
2. Parse each record: the first line of a record is treated as its ID; the remaining lines are joined and cleaned into the sequence.
3. Count G and C bases: tally G and C occurrences in the cleaned sequence for each record.
4. Compute the ratio: GC% = (G + C) / sequence length × 100 for each record.
5. Find every tied maximum: after all records are scored, find the highest displayed GC percentage, then collect every record that shares it, rather than stopping at the first one found.
6. Report results: display the highest-GC record (or the full set of tied records) plus a table of every record's stats, with tied rows visibly flagged.

Pseudocode

Implementation Details

• Record splitting: the dataset is split with a regular expression that matches > only at the start of a line, so a stray > character inside a sequence body would not incorrectly start a new record.
• Empty-sequence guard: if a record's sequence has zero length after cleaning, its GC ratio is reported as 0% rather than causing a division-by-zero error.
• Per-record cleaning: each record's sequence is independently uppercased and stripped of any character outside A/T/C/G before counting, so a malformed header or stray whitespace in one record does not affect others.
• Tie-breaking: ties are detected at the same 6-decimal precision shown in the table. If two or more records share the highest displayed GC ratio, every tied record is flagged with a 🏆 marker and highlighted in the table, and the summary lists all tied sequence IDs rather than silently picking one.
• Reported summary: the top result box always reflects the current tie state — a single ID and percentage when there's a unique highest record, or a count plus the full list of tied IDs when there isn't.

What is a DNA motif?

A DNA motif is a short sequence pattern that can have biological significance. Motifs may occur in regions involved in processes such as:

• transcription regulation
• protein-DNA binding
• replication
• RNA processing
• other molecular interactions

For example, a researcher may be interested in the pattern TATA and want to determine where that pattern occurs in a DNA sequence.

Important: a motif is a pattern, not automatically a gene or protein-coding region. Finding TATA does not by itself prove that a functional regulatory element exists.

Why do scientists search for motifs?

DNA contains enormous amounts of sequence information. Researchers may already know that a particular protein tends to bind near a certain sequence pattern. Instead of manually examining thousands of bases, a computer can search the sequence and report every location where the pattern occurs.

This allows researchers to quickly investigate potential sites of biological interest.

Motif vs DNA sequence

Think of it this way: the DNA sequence is the complete string being examined. The motif is the smaller pattern being searched for inside it.

How does the computer search for a motif?

Suppose Sequence = GATATAC and Motif = TATA (length 4). The computer examines every possible 4-base window and compares it with the motif. Only the window that equals TATA exactly counts as a match.

The window moves one nucleotide at a time. This one-nucleotide movement is important because it allows overlapping matches to be found.

Why overlapping matches matter

An overlapping match occurs when two motif occurrences share some nucleotides. Consider Sequence = ATATAT, Motif = ATAT:

The second match starts two bases after the first, and the two matches overlap. If the algorithm jumped forward by the motif's entire length after finding a match, it would miss the second occurrence. Overlapping matches should normally be reported, because they represent real occurrences of the requested pattern.

Positions: 0-based vs 1-based

Computers commonly count positions starting at 0, but biology users often prefer counting from 1, since it is easier for beginners to interpret. For Sequence ATATAT, Motif ATAT:

This tool displays positions as 1-based for readability, and shows the 0-based index in the technical details below where relevant.

Lowercase input

DNA sequences may appear as atgcatata or ATGCATATA. Biologically these represent the same nucleotide sequence, so this tool normalizes all input to uppercase before searching. Matching is case-insensitive.

🔎 What does the tool report?

The result depends on the Matching Algorithm you choose.

1. Exact Matching

Finds positions where the DNA sequence matches the motif exactly, base for base.

Use when: you know the exact sequence you're looking for.

2. IUPAC Ambiguous Nucleotides

Real biological motifs are often not perfectly identical at every position. Instead of writing several exact motifs separately, an IUPAC ambiguity code represents a set of allowed bases at that position. For example, R = A or G, so a motif written TARA means the third position can be A or G.

For B, D, H, and V, the pattern is: each letter means "everything except the base whose letter comes right before it in the alphabet." B excludes A, D excludes C, H excludes G, and V excludes T (thinking of it as U, the RNA version of T).

The tool reports the position, matched sequence, and the motif pattern used. Use when: the biological pattern is known, but some positions can vary.

Where do motifs like this come from? Scientists don't invent them randomly — they study many DNA sequences where a particular protein is known to bind, notice that some positions are highly conserved while others vary, and represent that pattern with IUPAC notation (or, for more advanced analysis, a position weight matrix). This tool works from a motif you already supply, not automated motif discovery.

3. Mismatch Tolerance — Hamming Distance

Exact matching is not always enough. This mode finds sequences similar to the motif even when they contain a limited number of substitutions. Hamming distance simply counts how many positions differ between two equal-length sequences.

If Maximum Mismatches = 0, only exact matches count. If Maximum Mismatches = 1, this example is reported as a match. The tool reports the position, matched sequence, and the number of mismatches. Important: Hamming distance allows substitutions only, not insertions or deletions.

4. Search Reverse Complement Strand (+ and -)

DNA is double-stranded, so a motif may occur on either strand.

What do 5′ and 3′ mean? A DNA strand has a direction, like a one-way street. One end is labeled 5′ ("five prime"), the other 3′ ("three prime"), named after which carbon of the sugar ring is exposed there. The two strands of a DNA double helix always run in opposite directions: if one strand reads 5′→3′ left to right, its partner reads 3′→5′ left to right.

To search the opposite strand in the standard 5′→3′ orientation, the tool calculates the reverse complement — not to be confused with the plain complement.

The tool searches the forward strand and, when this mode is selected, the reverse complement strand, then reports which strand produced each match:

Use when: you don't want to miss a motif simply because it occurs on the opposite DNA strand.

🧠 Which search should I use?

Algorithm

Exact matching

If reverse-complement searching is enabled

Worked example: DNA = ATATCGTAT, Motif = TAT, motif length = 3.

Complexity: for a sequence of length n and a motif of length m, exact and IUPAC matching run in O((n − m + 1) × m) time, since every window position performs a base-by-base comparison. Mismatch tolerance mode has the same bound, with an early exit once the mismatch count exceeds the allowed maximum. Reverse-complement mode runs the same scan twice, once per strand.

Pseudocode — Exact Matching

Pseudocode — IUPAC Matching

Instead of asking window == motif, the program asks whether each nucleotide is allowed by the corresponding motif symbol.

Only if every position is valid do we report a match.

Pseudocode — Mismatch Tolerance

Maximum mismatches = 0 behaves as exact matching. Maximum mismatches = 1 allows one substitution, and so on.

Pseudocode — Reverse Complement

Implementation Details

• Overlapping matches are kept: the window advances one base at a time regardless of match outcome, so two matches that share nucleotides (e.g. both ATAT occurrences in ATATAT) are both reported rather than the second being skipped.
• One motif field, multiple patterns: the motif input accepts several patterns separated by commas or newlines; each is searched independently and all results are merged into a single sorted-by-position table.
• Reverse complement is computed once per motif, not per position: when Reverse Complement mode is on, the tool derives the reverse complement of the motif itself and runs the normal forward-scan logic against it, rather than reverse-complementing the DNA sequence.