Fast algorithms to enumerate all common intervals of two permutations (Q1969959)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1969959 |
scientific article; zbMATH DE number 1417541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms to enumerate all common intervals of two permutations |
scientific article; zbMATH DE number 1417541 |
Statements
Fast algorithms to enumerate all common intervals of two permutations (English)
0 references
19 March 2000
0 references
common intervals of permutations
0 references
random permutations
0 references
0.8721771240234375
0 references
0.8534373641014099
0 references
0.8430836200714111
0 references
0.8399223685264587
0 references
