Reconstructing Words from Right-Bounded-Block Words
From MaRDI portal
Recommendations
- Reconstructing words from right-bounded-block words
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
- Reconstructing words from subwords in linear time
- On the possibility of a periodic word reconstruction from the subwords of fixed length
- On a reconstruction problem for sequences
Cites work
- A congruence theorem for trees
- An improvement of a Borwein-Erdélyi-Kós result
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Characterization of a word by its subwords
- Fine-Grained Complexity Theory (Tutorial)
- scientific article; zbMATH DE number 417855 (Why is no real title available?)
- scientific article; zbMATH DE number 5604082 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 525969 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3258862 (Why is no real title available?)
- Introduction to algorithms.
- Leaf-reconstructibility of phylogenetic networks
- Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
- On a reconstruction problem for sequences
- On Reconstruction of Matrices
- Reconstructing words from subwords in linear time
- Reconstruction from subsequences.
- Reconstruction of sequences
- Subwords in reverse-complement order
- Ulam's Conjecture and Graph Reconstructions
Cited in
(11)- \(k\)-spectra of weakly-\(c\)-balanced words
- Scattered Factor-Universality of Words
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence
- On Simon's congruence closure of a string
- Characterizations of families of morphisms and words via binomial complexities
- Tight bounds for the number of absent subsequences
- Jumbled scattered factors
- q-Parikh matrices and q-deformed binomial coefficients of words
- Recovery of cyclic words by their subwords
- Scattered factor universality -- a survey
- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words
This page was built for publication: Reconstructing Words from Right-Bounded-Block Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169894)
