algorithm - calculating Lempel-Ziv (LZ) complexity (aka sequence complexity) of a binary string -

-

i need calculate lz-complexity of binary string. lz-complexity number of differencet substrings encountered stream viewed begining end. example:

s = 1001111011000010

marking in different substrings sequence complexity c(s) = 6: s = 1 / 0 / 01 / 1110 / 1100 / 0010 /

can guide me find simple solution that? sure there should straight-forward implementations well-known problem, have difficulty finding them. can done done constructing suffix tree or similar. if yes, how? , should do?

anyone knows of c/c++ source code accomplish task?

thanks in advance.

to clarify construction of tree suggested in answers. tree looks this?

         o        /   \       o     o      / \   / \     o   o o   o        /     /       o     o

below quick example of how compute lz-complexity using tree. convenience - mine; not yours - code implements fixed-sized pre-allocated tree, , prime example of why void* pointers ugly use , difficult maintain. hand code in is, , lecturer shoot in face :)

#include <stdlib.h> #include <stdio.h>  int lzcomplexity(char *p_binarysequence, int p_maxtreenodes) {  void **patterntree;  void **currentnode;  void **nextfreenode;  int nodecount;  int sequenceindex;  int currentdigit;   nodecount = 0;  patterntree = malloc(sizeof(void*) * (p_maxtreenodes << 1));  currentnode = patterntree;  nextfreenode = patterntree + (sizeof(void*) << 1);  currentnode[0] = null;  currentnode[1] = null;  sequenceindex = 0;   while (p_binarysequence[sequenceindex])  {   currentdigit = p_binarysequence[sequenceindex] - 48;   if (null == currentnode[currentdigit])   {    currentnode[currentdigit] = nextfreenode;    nextfreenode[0] = null;    nextfreenode[1] = null;    nextfreenode += (sizeof(void*) << 1);    currentnode = patterntree;    nodecount++;   }   else   {    currentnode = currentnode[currentdigit];   }   sequenceindex++;  }   free(patterntree);  return nodecount; }   int main(int argc, char *argv[]) {  printf("%u\n", lzcomplexity("10100101001011101011", 1000));  return 0; }

Comments

Post a Comment

Popular posts from this blog

python - Scipy curvefit RuntimeError:Optimal parameters not found: Number of calls to function has reached maxfev = 1000 -

-
Image
i want make logharitmic fit. keep getting runtime error: optimal parameters not found: number of calls function has reached maxfev = 1000 i use following script. can tell me go wrong? use spyder still beginner. import math import matplotlib mpl scipy.optimize import curve_fit import numpy np #data f1=[735.0,696.0,690.0,683.0,680.0,678.0,679.0,675.0,671.0,669.0,668.0,664.0,664.0] t1=[1,90000.0,178200.0,421200.0,505800.0,592200.0,768600.0,1036800.0,1371600.0,1630800.0,1715400.0,2345400.0,2409012.0] f1n=np.array(f1) t1n=np.array(t1) plt.plot(t1,f1,'ro',label="original data") # curvefit def func(t,a,b): return a+b*np.log(t) t=np.linspace(0,3600*24*28,13) popt, pcov = curve_fit(func, t, f1n, maxfev=1000) plt.plot(t, func(t, *popt), label="fitted curve") plt.legend(loc='upper left') plt.show() your original data t1 , f1 . therefore curve_fit should given t1 second argument, not t . popt, pcov = curve_fit(func,...
Read more

binding - How can you make the color of elements of a WPF DrawingImage dynamic? -

-
we have need make vector graphic images change color of elements within graphic @ runtime. seem setting colors based on either static or dynamic resource values wouldn't work. want have multiple versions of same graphic, each abilty set graphic elements (path, line, etc) different colors don't think dynamic resource approach work. leaves data binding seems right approach. update graphic use data binding expr instead of hard-coded brush color so: <drawingimage x:key="graphic1"> <drawingimage.drawing> <drawinggroup> <drawinggroup.children> <geometrydrawing geometry="f1 m 8.4073,23.9233l"> <geometrydrawing.pen> <pen linejoin="round" brush="{binding line1brush, mode=oneway}"/> </geometrydrawing.pen> </geometrydrawing> <geometrydrawing geometry="f1 m 3.6875,2.56251l"> <geometrydrawing....
Read more

c# - How to add a new treeview at the selected node? -

-
i have treeview 4 levels; parent, child, grandchild, great-grandchild. selectednode @ grandchild level. what i'm trying create new "treeview" @ grandchild - no, dont wnat create new node "selectednode" (grandchild). should somelike this: parent child grandchild (new treeview) parent grandchild great-grandchild child great-grandchild child grandchild grandchild it similar parent table mother , father went off , had new childern different spouse other spouse of there existing children. private sub populaterootlevel() ' query find first round of parent populatenodes(dt, jcatreeview.nodes) end sub private sub populatenodes(byval dt datatable, byval nodes treenodecollection) each dr datarow in dt.rows dim tn new treenode() tn.text = dr("title").tostring()...
Read more