⌕ Поиск по атласу

NIST · ИТ · d49cfebe358ceb6cbd4a

d49cfebe358ceb6cbd4a · Journal Article

Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length

Официальный источник · 2017-06-21

Полные импортированные сведения карточки
{
  "title_en": "Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length",
  "designation": "Journal Article",
  "series": "Journal Article",
  "status": "Final",
  "date": "2017-06-21",
  "date_original": "6/21/2017",
  "url": "https://csrc.nist.gov/pubs/journal/2017/06/nearoptimal-algorithm-to-count-occurrences-of-subs/final",
  "source": "CSRC",
  "display_en": "Journal Article (Final)",
  "authors_en": "",
  "abstract_excerpt_en": "",
  "id": "d49cfebe358ceb6cbd4a",
  "sources": [
    "CSRC"
  ],
  "source_records": [
    {
      "title_en": "Near-Optimal Algorithm to Count Occurrences of Subsequences of a Given Length",
      "designation": "Journal Article",
      "series": "Journal Article",
      "status": "Final",
      "date": "2017-06-21",
      "date_original": "6/21/2017",
      "url": "https://csrc.nist.gov/pubs/journal/2017/06/nearoptimal-algorithm-to-count-occurrences-of-subs/final",
      "source": "CSRC",
      "display_en": "Journal Article (Final)",
      "authors_en": "",
      "abstract_excerpt_en": ""
    }
  ],
  "translation_state": "none"
}