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”
EN
ČeštinaEnglish

Filters

33 275 (0,111s) •

Result

Finite Automata for Generalized Approach to Backward Pattern Matching

We generalized the DAWG backward pattern matching approach to be able to solve a broad range of pattern matching problems. We use a definition of a class of problems. We describe a finite automaton for the basic

IN - Informatika

  • 2011
    • •
  • D
    • •
  • Link
Result

2D Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching

A very fast parallel approach to pattern matching is presented. The approach which helps to achieve very fast parallel pattern matching algorithms. The parallel pattern matching takes O(1) time fo...

IN - Informatika

  • 2006
    • •
  • D
Result

Pattern Matching in Huffman Coded Text

We present a simple and effective algorithm for pattern matching in text compressed by static Huffman coding. Our algorithm can be used to solve any pattern matching problem....

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

  • 2003
    • •
  • D
Result

Template-Based Pattern Matching in Two-Dimensional Arrays

We propose a framework for pattern matching in twodimensional arrays of symbols where the patterns are described by an extended version of the regular matrix to reformulate the 2D pattern matching as the o...

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

  • 2017
    • •
  • D
    • •
  • Link
Result

Backward Linearised Tree Pattern Matching

We present a new backward tree pattern matching algorithm for ordered trees. The algorithm finds all occurrences of a single given tree pattern which match an input tree matching approaches. The number of ...

IN - Informatika

  • 2015
    • •
  • D
    • •
  • Link
Result

Two-dimensional Pattern Matching Using Finite Automata

This article overviews a new approach of the two-dimensional pattern matching based on finite automata. Furthermore, two implementations of this generic principle for the 2D exact and 2D approximate matching are presented h...

IN - Informatika

  • 2005
    • •
  • A
Result

On Two-Dimensional Pattern Matching By Finite Automata

This paper presents a general concept of two-dimensional pattern matching using conventional finite automata and its two particular realizations for exact and approximate two-dimensional pattern matching....

IN - Informatika

  • 2006
    • •
  • D
Result

Backward Pattern Matching Automaton

This paper presents a formal specification of a new backward pattern matching algorithm which is based on a formaly specified nondeterministic model. This model is given in the form of attributed finite automaton. This new algorithm...

IN - Informatika

  • 2005
    • •
  • D
Result

Linear Pattern Matching with Swaps for Short Patterns

The Pattern Matching problem with swaps is a variation of the classical pattern matching problem. It consists of finding all the occurrences of a pattern P in a text T present a new, efficient method for t...

IN - Informatika

  • 2009
    • •
  • D
Result

Dyck paths and pattern-avoiding matchings

We prove combinatorial identities between pattern-avoiding families of matchings.

BA - Obecná matematika

  • 2007
    • •
  • Jx
  • 1 - 10 out of 33 275