In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n′ + m′ + mn′ + nm′ +mn) where n and m are the lengths of the maps and n′ and m′ are the sizes of run-length encoded maps. We show that this algorithm makes a significant improvement for the real biological data, dividing the computing time by a factor 30 on a significant set of data.

A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length n. A number of associated problems have also been investigated. In this paper we consider a ne...

Extracting a block of interest referred to as segmenting a specified block in an image and studying its characteristics is of general research interest, and could be a challenging if such a segmentation task has to be carried out directly in a compressed image. This is the objective of the present research work. The proposal is to evolve a method which would segment and extract a specified bloc...

The objective of this paper is to present explicit analytical formulas for evaluating important characteristics of Double Moving Average control chart (DMA) for Poisson distribution. The most popular characteristics of a control chart are Average Run Length ( 0 ARL ) the mean of observations that are taken before a system is signaled to be out-of control when it is actually still incontrol, and...

sever& texture features are introduced from a proposed higher-order statistical matrix, the gray level gap length matrix (GLGLM). The GLGLM measures the gray level variations in an image. It complements the gray level run length matrix (GLRLM) and is more superior when the number of gray level is large. Features extracted from the weighted GLGLM can be used to estimate the size distribution of ...

The capacity of a three-dimensional (0 1) run length constrained channel is shown to satisfy 0 522501741838 0 526880847825.

Two-dimensional binary patterns that satisfy onedimensional (d; k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd; k is defined as Cd; k = limm;n!1 log2N (d; k) m;n =mn, where N (d; k) m;n denotes the number of m n rectangular patterns that satisfy the two-dimensional (d; k) run-length constraint. Bounds on Cd; k are given and it is ...

The paradigm of minimal length encoding is used for superior segmenting and compressing of waveforms. These methods sre shown to be applicable also for segmenting and edge nding in pictures.