Add to ORKGThis paper presents an O(mn log n) time algorithm for an approximate string matching problem, in which a pattern string may contain variable length don't care characters. This problem is important for searching DNA sequences or amino acid sequences
In the molecular biology, it is said that two biological sequences tend to have similar properties i...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
AbstractAn approximate string-matching algorithm is described based on earlier attribute-matching al...
[[abstract]]In this paper, a novel algorithm for approximate pattern matching fom multiple DNA or am...
Approximate string matching is a basic and important concept in many applications of information ret...
Given a text string of length n and a pattern string of length m over a b-letter alphabet, the k dif...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, t...
Aiti : Jurnal Teknologi Informasi, Vol. 4, No. 1, Februari 2007, p. 1-15Finite automata is a very us...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Abstract. We consider string matching with variable length gaps. Given a string T and a pattern P co...
abstracttocpublished_or_final_versionComputer Science and Information SystemsMasterMaster of Philoso...
Abstract Background The problem of approximate string matching is important in many different areas ...
some alphabet Σ = {a1... aK} and a pattern or query string P = p1... pm, m < n in the same alphab...
In the molecular biology, it is said that two biological sequences tend to have similar properties i...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
AbstractAn approximate string-matching algorithm is described based on earlier attribute-matching al...
[[abstract]]In this paper, a novel algorithm for approximate pattern matching fom multiple DNA or am...
Approximate string matching is a basic and important concept in many applications of information ret...
Given a text string of length n and a pattern string of length m over a b-letter alphabet, the k dif...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, t...
Aiti : Jurnal Teknologi Informasi, Vol. 4, No. 1, Februari 2007, p. 1-15Finite automata is a very us...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Abstract. We consider string matching with variable length gaps. Given a string T and a pattern P co...
abstracttocpublished_or_final_versionComputer Science and Information SystemsMasterMaster of Philoso...
Abstract Background The problem of approximate string matching is important in many different areas ...
some alphabet Σ = {a1... aK} and a pattern or query string P = p1... pm, m < n in the same alphab...
In the molecular biology, it is said that two biological sequences tend to have similar properties i...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...