AbstractIn this paper, we present linear-time algorithms for the construction two novel types of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS), Shortest Common Supersequence (SCS) and Constrained Longest Common Subsequence (CLCS) problems for degenerate strings
In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
Uncertain sequences are compact representations of sets of similar strings. They highlight common se...
AbstractIn this paper, we present linear-time algorithms for the construction two novel types of fin...
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreo...
In this paper, we introduce two efficient algorithms in practice for computing the length of a longest...
AbstractWe show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet l...
AbstractGiven a finite set of strings X, the Longest Common Subsequence problem (LCS) consists in fi...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
Abstract. Given a finite set of strings X, the longest common subsequence problem (LCS) consists in ...
In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find...
AbstractThe longest common subsequence (LCS) problem is one of the classical and well-studied proble...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
In this paper, we present a fast and simple algorithm for constructing a minimal acyclic determinist...
In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
Uncertain sequences are compact representations of sets of similar strings. They highlight common se...
AbstractIn this paper, we present linear-time algorithms for the construction two novel types of fin...
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreo...
In this paper, we introduce two efficient algorithms in practice for computing the length of a longest...
AbstractWe show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet l...
AbstractGiven a finite set of strings X, the Longest Common Subsequence problem (LCS) consists in fi...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
Abstract. Given a finite set of strings X, the longest common subsequence problem (LCS) consists in ...
In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find...
AbstractThe longest common subsequence (LCS) problem is one of the classical and well-studied proble...
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with re...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
In this paper, we present a fast and simple algorithm for constructing a minimal acyclic determinist...
In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
Uncertain sequences are compact representations of sets of similar strings. They highlight common se...
DOI
Add to ORKG