Pattern Containment
Pattern Containment is a binary relation on permutations in which a permutation π is said to contain a pattern σ if there exists a subsequence of π that is order-isomorphic to σ.
10
Publications
308
Citations
26
Authors
30
Institutions
Publications per year
2017–2026
0
Parents
10
Structured materialized views for XML queries
Andrei Arion, Véronique Benzaken, Ioana Manolescu et al. · 2007 · 65 citations
Answering graph pattern queries using views
Wenfei Fan, Xin Wang, Yinghui Wu · 2014 · 39 citations · Full text
Closed and noise-tolerant patterns in n-ary relations
Loïc Cerf, Jérémy Besson, Kim-Ngan T. Nguyen et al. · Data Mining and Knowledge Discovery · 2012 · 37 citations
1–5 of 10
26
3
h-index
3
h-index
2
h-index
2
h-index
1
h-index
1–5 of 26
30

University Ucinf
Santiago, Chile
2 h-index
2 publications
30 citations
University of Florence
Florence, Italy
2 h-index
5 publications
100 citations
Heilbronn Institute for Mathematical Research
Bristol, United Kingdom
2 h-index
2 publications
41 citations
Gestione Sistemi per l’Informatica (Italy)
Rome, Italy
2 h-index
4 publications
75 citations
Universidade Federal de Minas Gerais
Belo Horizonte, Brazil
1 h-index
1 publications
37 citations
Dartmouth College
Hanover, United States
1 h-index
1 publications
36 citations

Southwest Jiaotong University
Chengdu, China
1 h-index
1 publications
39 citations

University of New Caledonia
Noumea, New Caledonia
1 h-index
1 publications
16 citations
1–8 of 30
3 publications · 74 citations
3
h-index
1 publications · 24 citations
1
h-index
1 publications · 37 citations
1
h-index
DMTCS · 1 publications · 17 citations
1
h-index
1 publications · 36 citations
1
h-index
1–5