In the paper two combinatorial problems for the set F n q of sequences of length n over the alphabet F q =[0, 1, ..., q&1] are considered. The maximum size N & q (n, t) of the set of common subsequences of length n&t and the maximum size N + q (n, t) of the set of common supersequences of length n+t
β¦ LIBER β¦
Nondecreasing subsequences of t-sequences
β Scribed by Tat-Hung Chan
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 239 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Efficient Reconstruction of Sequences fr
β
Vladimir I. Levenshtein
π
Article
π
2001
π
Elsevier Science
π
English
β 176 KB
On the uniform distribution modulo one o
β
Jean Coquet
π
Article
π
1980
π
Elsevier Science
π
English
β 246 KB
On the uniform distribution modulo one o
β
Jean Coquet
π
Article
π
1978
π
Elsevier Science
π
English
β 228 KB
Existence of pseudoconvergent subsequenc
β
S. A. Rudakov
π
Article
π
1980
π
SP MAIK Nauka/Interperiodica
π
English
β 492 KB
Segmentation of Heteropolymer Sequences
β
Leonid V. Gusev; Valentina V. Vasilevskaya; Vsevolod Ju. Makeev; Pavel G. Khalat
π
Article
π
2003
π
John Wiley and Sons
π
English
β 230 KB
## Abstract We have studied the segmentation of twoβletter **__AB__** heterosequences composed of subsequences with different composition and distribution of **__A__** and **__B__** monomer units along the chain. Our approach is based on the segmentation function __S__(__k__) introduced in the pres
Optimum partitioning of a sequence of el
β
T. K. Vintsyuk
π
Article
π
1973
π
Springer US
π
English
β 462 KB