Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources

2002 ◽  
Vol 48 (7) ◽  
pp. 2022-2035 ◽  
Author(s):  
I. Tabus ◽  
J. Rissanen
1987 ◽  
Vol 33 (2) ◽  
pp. 246-257 ◽  
Author(s):  
T. Tjalkens ◽  
F. Willems
Keyword(s):  

1968 ◽  
Vol 07 (03) ◽  
pp. 156-158
Author(s):  
Th. R. Taylor

The technique, scope and limitations of a fixed field/fixed length case record utilising the IBM 1232 system is described. The principal problems lie with personnel rather than machinery and with programmes for analysis rather than clinical data.


2020 ◽  
Vol 84 (11) ◽  
pp. 1335-1340
Author(s):  
P. Kasprzak ◽  
K. Kazimierczuk ◽  
A. L. Shchukina
Keyword(s):  

2021 ◽  
Vol 54 (1) ◽  
pp. 1-22
Author(s):  
Rayan Chikhi ◽  
Jan Holub ◽  
Paul Medvedev

The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of k -mers, which are short fixed-length strings present in a dataset. While these approaches are rather diverse, storing and querying a k -mer set has emerged as a shared underlying component. A set of k -mers has unique features and applications that, over the past 10 years, have resulted in many specialized approaches for its representation. In this survey, we give a unified presentation and comparison of the data structures that have been proposed to store and query a k -mer set. We hope this survey will serve as a resource for researchers in the field as well as make the area more accessible to researchers outside the field.


Sign in / Sign up

Export Citation Format

Share Document