Tutte le sfide
Media 0 risolte 0% di accettazione

DNA Short Tandem Repeats

For each short tandem repeat, find the longest run of back-to-back copies in a DNA sequence.

Cosa imparerai

  • Compare a substring of a string with a pattern
  • Count back-to-back copies starting at a position
  • Keep the best count for each pattern

Problema

Mostra traduzione

Forensic labs compare people by short tandem repeats (STRs): short DNA units such as AGAT that appear many times in a row. For each unit, the lab records the longest run of consecutive copies anywhere in the sequence. In TTAGATAGATAGATCAGATAGAT the unit AGAT appears three times in a row near the start and twice later, so its count is 3.

Implement dna_str_count(sequence, repeats).

Input

sequence: The DNA sequence, using the letters A, C, G and T.

repeats: The STR units to measure.

Output

Return one count per unit, in the same order as repeats: the largest number of copies that appear back to back. A unit that never appears has count 0.

Vincoli

0 ≤ length of sequence ≤ 5,000

1 ≤ number of units ≤ 10

Each unit has 1 to 8 letters

Esempi

Esempio 1
Input:
sequence = "TTAGATAGATAGATCAGATAGAT"
repeats = ["AGAT", "CA"]

Output atteso:
expected = [3, 1]
Input:
std::string sequence = "TTAGATAGATAGATCAGATAGAT";
std::vector<std::string> repeats = {"AGAT", "CA"};

Output atteso:
std::vector<long long> expected = {3, 1};
Input:
string sequence = "TTAGATAGATAGATCAGATAGAT";
string[] repeats = new string[] {"AGAT", "CA"};

Output atteso:
long[] expected = new long[] {3, 1};

Spiegazione

AGAT runs 3 times at the start and only twice at the end, so it scores 3; CA appears once, so it scores 1.

Esempio 2
Input:
sequence = "AATGAATGAATGTATC"
repeats = ["AATG", "TATC", "GATA"]

Output atteso:
expected = [3, 1, 0]
Input:
std::string sequence = "AATGAATGAATGTATC";
std::vector<std::string> repeats = {"AATG", "TATC", "GATA"};

Output atteso:
std::vector<long long> expected = {3, 1, 0};
Input:
string sequence = "AATGAATGAATGTATC";
string[] repeats = new string[] {"AATG", "TATC", "GATA"};

Output atteso:
long[] expected = new long[] {3, 1, 0};

Spiegazione

AATG repeats 3 times, TATC once and GATA never: [3, 1, 0].

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

From a start position, keep jumping forward by the unit length while the next piece equals the unit.

Suggerimento 2

Try every start position and remember the largest run.

Suggerimento 3

A unit that never matches leaves the best count at 0.

Complessità attesa

O(n × m × k) time, O(m) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.