Name
Abstract | ||
|---|---|---|
The main goal of this paper is to present a new extension of KMRCRelat algorithm allowing Word Train searches. First, we recall the fundamental lemma of our KMRCRelat algorithm and we focus on the concept of flexible relational repeated words. Then, we introduce the concept of Word Trains and we show, in deep, the needed modification and extension to include such features in this algorithm. To illustrate Word Train searches, we present all details about KMRCRelat extension computation steps. We also show how this new extension is applicable to the characterization of short tandem repeat in DNA sequence providing an alternative way to solve originally this known problem in sequence analysis. Before concluding by introducing other possible KMRCRelat applications, the paper expands a set of experimental results obtained when applied to locus identification problem. |
Year | Venue | Keywords |
|---|---|---|
2006 | J. Comput. Meth. in Science and Engineering | possible kmrcrelat application,dna sequence,word train search,known problem,new extension,word trains,sequence analysis,locus identification problem,biological problem,kmrcrelat algorithm,kmrcrelat extension computation step,patterns,sequences,pattern recognition |
Field | DocType | Volume |
Fundamental lemma,Computer science,Algorithm,Train,Parameter identification problem,Computation | Journal | 6 |
Issue | ISSN | Citations |
5 | 1472-7978 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nahla El Zant El Kadhi | 1 | 0 | 1.01 |
| Nabil El Kadhi | 2 | 5 | 2.45 |
| Pierre-Antoine Gourraud | 3 | 2 | 1.80 |