We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...