Artificial sequences and complexity measures
نویسندگان
چکیده
منابع مشابه
Artificial Sequences and Complexity Measures
In this paper we exploit concepts of information theory to address the fundamental problem of identifying and defining the most suitable tools to extract, in a automatic and agnostic way, information from a generic string of characters. We introduce in particular a class of methods which use in a crucial way data compression techniques in order to define a measure of remoteness and distance bet...
متن کاملComplexity measures for assembly sequences
Our work focuses on various complexity measures for two-handed assembly sequences. For many products, there exist an exponentially large set of valid sequences, and a natural goal is to use automated systems to select wisely from the choices. Since assembly sequencing is a preprocessing phase for a long and expensive manufacturing process, any work towards nding a better assembly sequence is of...
متن کاملOn the complexity measures of genetic sequences
MOTIVATION It is well known that the regulatory regions of genomes are highly repetitive. They are rich in direct, symmetric and complemented repeats, and there is no doubt about the functional significance of these repeats. Among known measures of complexity, the Ziv-Lempel complexity measure reflects most adequately repeats occurring in the text. But this measure does not take into account is...
متن کاملComplexity Measures and Cellular
A bstract . Various observables meas urin g the complexi ty of an ensemble of pattern s are discussed , in par ticul ar statistical quantit ies rela ted to the convergence of block entropies, an d comp utation t heoret ical quanti ties related to a gram matical description of t he ensem ble. T hese measures of com plexity are applied to one-dime nsio nal cellular automata, by char acterizing th...
متن کاملOther Complexity Classes and Measures
Some natural problems seem not to be complete for any of the complexity classes we have seen so far. For example, consider the problem of taking as input a graph G and a number k, and deciding whether k is exactly the length of the shortest traveling salesperson’s tour. This is clearly related to the problem discussed in Chapter 28, Section 3, but in contrast to , it seems not to belong to NP, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2005
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2005/04/p04002