All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Suffix Automata and Parallel String Matching

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03133193" target="_blank" >RIV/68407700:21230/07:03133193 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Suffix Automata and Parallel String Matching

  • Original language description

    We present a parallel string matching methodology. The methodology allows exact and approximate string matching using any edit distance preserving the length of string. Hamming,Delta, Gamma, and DeltaGamma distances are examples of such edit distance. The parallel string matching methodology provides cost-optimal EREW PRAM algorithms. The algorithms run in O(m) parallel time using O(n/m) processors.

  • Czech name

    Sufixový automat a paralelní vyhledávání v textu

  • Czech description

    Naše metodologie pro paralelní vyhledávání s Hammingovou, Delta, Gamma, a Delta-Gamma vzdáleností používající suffixový automat běží v čase O(m) a při použití O(n/m) procesorů, kde m je délka vzorku a n je délka textu.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA201%2F06%2F1039" target="_blank" >GA201/06/1039: Text processing and analysis</a><br>

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    London Algorithmics and Stringology

  • ISBN

    978-1-904987-41-3

  • ISSN

  • e-ISSN

  • Number of pages

    28

  • Pages from-to

    149-176

  • Publisher name

    King's College

  • Place of publication

    London

  • Event location

    London

  • Event date

    Feb 6, 2006

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article