Name
Abstract | ||
|---|---|---|
We define the locally maximal subwords and locally minimal superwords common to a finite set of words. We also define the corresponding sets of alignments. We give a partial order relation between such sets of alignments, as well as two operations between them. We show that the constructed family of sets of alignments has the lattice structure. We give hints to use this structure as a machine learning basis for inducing a generalization of the set of words. |
Year | Venue | Field |
|---|---|---|
2012 | ICGI | Discrete mathematics,Family of sets,Finite set,Lattice (order),Computer science |
DocType | Volume | Citations |
Journal | 21 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Miclet | 1 | 243 | 31.55 |
| Nelly Barbot | 2 | 28 | 10.28 |
| baptiste jeudy | 3 | 98 | 8.44 |