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”

Filters

8 675 (0,335s)

Result

Generalized and Weighted Strings: Repetitions and Pattern Matching

pattern matching problem on strings to an automaton for the pattern matching problemGeneralized and weighted strings are special strings capable of expressing of strings are mainly used in molecu...

IN - Informatika

  • 2004
  • C
Result

Suffix Automata and Parallel String Matching

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...

IN - Informatika

  • 2007
  • D
Result

Filtering Invalid Off-Targets in CRISPR/Cas9 Design Tools

The paper deals with an approximate string matching in CRISPR/Cas9 design tools. The approximate string matching is transformed into sequence of exact string matching tasks processed by fast succi...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2018
  • O
  • Link
Result

Improving Practical Exact String Matching

We present improved variations of the BNDM algorithm for exact string matching. At each alignment the algorithms read a $q$-gram before testing the state variable. In addition we apply reading a 2-gram in one instruction....

IN - Informatika

  • 2010
  • Jx
Result

String Matching for IPv6 Routers

String matching problem instantiates in IP routing into several operations on packet headers. Routing itself is finding the best matching prefix of a set of strings, packet filtering is a combination of prefix ...

JC - Počítačový hardware a software

  • 2004
  • D
Result

Approximate String Matching by Fuzzy Automata

We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the oth...

JC - Počítačový hardware a software

  • 2009
  • D
Result

Neural String Edit Distance

We propose the neural string edit distance model for string-pair matching and string transduction based on learnable string edit distance. We modify the original expectation-maximization learned edit dista...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
  • D
  • Link
Result

Tuning BNDM with q-Grams

We develop bit-parallel algorithms for exact string matching. Our algorithms are variations of the BNDM and Shift-Or algorithms. At each alignment the algorithms read a $q$-gram before testing the state variable. In addition we appl...

IN - Informatika

  • 2009
  • D
Result

Fast Pattern-Matching on Indeterminate Strings

In a string x on an alphabet, a position i is said to be indeterminate iff x[i] may be any one of a specified subset of alphabet. A string x containing indeterminate positions is therefore also said to be indeterminate. Indeterminat...

IN - Informatika

  • 2008
  • Jx
Result

Approximate String Matching by Fuzzy Automata

We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the oth...

JC - Počítačový hardware a software

  • 2009
  • Jx
  • 1 - 10 out of 8 675