Weak containment for partial words is coNP-complete

2016 ◽  
Vol 116 (2) ◽  
pp. 125-127
Author(s):  
Paweł Parys
2020 ◽  
Vol 9 (11) ◽  
pp. 9219-9230
Author(s):  
R.K. Kumari ◽  
R. Arulprakasam ◽  
R. Perumal ◽  
V.R. Dare

Partial words are linear words with holes. Cyclic words are derived from linear words by linking its first letter after the last one. Both partial words and cyclic words have wide applications in DNA sequencing. In this paper we introduce cyclic partial words and discuss their periodicity and certain properties. We also establish representation of a cyclic partial word using trees.


2021 ◽  
Vol 1850 (1) ◽  
pp. 012073
Author(s):  
R. Krishna Kumari ◽  
R. Arulprakasam ◽  
V.R. Dare
Keyword(s):  

2015 ◽  
Vol 185 ◽  
pp. 26-37 ◽  
Author(s):  
F. Blanchet-Sadri ◽  
Michelle Bodnar ◽  
Jordan Nikkel ◽  
J.D. Quigley ◽  
Xufan Zhang
Keyword(s):  

2014 ◽  
Vol 179 ◽  
pp. 174-192 ◽  
Author(s):  
Florin Manea ◽  
Robert Mercaş ◽  
Cătălin Tiseanu
Keyword(s):  

2014 ◽  
Vol 268 ◽  
pp. 290-304 ◽  
Author(s):  
Jürgen Dassow ◽  
Florin Manea ◽  
Robert Mercaş

2018 ◽  
Vol 713 ◽  
pp. 56-65 ◽  
Author(s):  
Bennet Goeckner ◽  
Corbin Groothuis ◽  
Cyrus Hettle ◽  
Brian Kell ◽  
Pamela Kirkpatrick ◽  
...  
Keyword(s):  

2011 ◽  
Vol 32 (6) ◽  
pp. 1805-1835 ◽  
Author(s):  
MIKLÓS ABÉRT ◽  
GÁBOR ELEK

AbstractWe study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct continuum many pairwise weakly inequivalent free actions of a large class of groups, including free groups and linear groups with property (T). We also prove that for chains of subgroups of finite index, Lubotzky’s property (τ) is inherited when taking the intersection with a fixed subgroup of finite index. That this is not true for families of subgroups in general leads to the question of Lubotzky and Zuk: for families of subgroups, is property (τ) inherited by the lattice of subgroups generated by the family? On the other hand, we show that for families of normal subgroups of finite index, the above intersection property does hold. In fact, one can give explicit estimates on how the spectral gap changes when passing to the intersection. Our results also have an interesting graph theoretical consequence that does not use the language of groups. Namely, we show that an expanding covering tower of finite regular graphs is either bipartite or stays bounded away from being bipartite in the normalized edge distance.


Sign in / Sign up

Export Citation Format

Share Document