Results 1  10
of
198,898
H: Pseudoperiodic partitions of biological sequences
 Bioinformatics
"... Motivation: Algorithm development for finding typical patterns in sequences, especially multiple pseudorepeats (pseudoperiodic regions), is at the core of many problems arising in biological sequence and structure analysis. In fact, one of the most significant features of biological sequences is th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
is their high quasirepetitiveness. Variation in the quasirepetitiveness of genomic and proteomic texts demonstrates the presence and density of different biologically important information. It is very important to develop sensitive automatic computational methods for the identification of pseudoperiodic
m Mathematical Publications REPETITION AND PSEUDOPERIODICITY
"... ABSTRACT. Many phenomena exhibit great regularity without being periodic. This is modeled using the notion of \pseudoperiodic " functions and the related \norm", which allow complex repetitive phenomena to be represented as a periodic process plus a set of parameters that de ne t ..."
Abstract
 Add to MetaCart
ABSTRACT. Many phenomena exhibit great regularity without being periodic. This is modeled using the notion of \pseudoperiodic " functions and the related \norm", which allow complex repetitive phenomena to be represented as a periodic process plus a set of parameters that de ne
The PseudoPeriod Technique in Parallel String Matching
"... We present improvements of known super fast parallel string matching algorithms. We introduce a new approach to parallel string matching called the pseudoperiod technique. It is efficient for a various parallel models of computation. In the sense of work (total number of operations) all presented a ..."
Abstract
 Add to MetaCart
We present improvements of known super fast parallel string matching algorithms. We introduce a new approach to parallel string matching called the pseudoperiod technique. It is efficient for a various parallel models of computation. In the sense of work (total number of operations) all presented
Pseudoperiodic homeomorphisms and degeneration of Riemann surfaces
 Bulletin of the AMS
, 1994
"... Abstract. We will announce two theorems. The first theorem will classify all topological types of degenerate fibers appearing in oneparameter families of Riemann surfaces, in terms of “pseudoperiodic ” surface homeomorphisms. The second theorem will give a complete set of conjugacy invariants for t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We will announce two theorems. The first theorem will classify all topological types of degenerate fibers appearing in oneparameter families of Riemann surfaces, in terms of “pseudoperiodic ” surface homeomorphisms. The second theorem will give a complete set of conjugacy invariants
STATISTICAL TOOLS FOR DISCOVERING PSEUDOPERIODICITIES IN BIOLOGICAL SEQUENCES
, 2001
"... Abstract. Many protein sequences present non trivial periodicities, such as cysteine signatures and leucine heptads. These known periodicities probably represent a small percentage of the total number of sequences periodic structures, and it is useful to have general tools to detect such sequences a ..."
Abstract
 Add to MetaCart
Abstract. Many protein sequences present non trivial periodicities, such as cysteine signatures and leucine heptads. These known periodicities probably represent a small percentage of the total number of sequences periodic structures, and it is useful to have general tools to detect such sequences
Nested Transactions: An Approach to Reliable Distributed Computing
, 1981
"... Distributed computing systems are being built and used more and more frequently. This distributod computing revolution makes the reliability of distributed systems an important concern. It is fairly wellunderstood how to connect hardware so that most components can continue to work when others are ..."
Abstract

Cited by 527 (1 self)
 Add to MetaCart
are broken, and thus increase the reliability of a system as a whole. This report addressos the issue of providing software for reliable distributed systems. In particular, we examine how to program a system so that the software continues to work in tho face of a variety of failures of parts of the system
Basic objects in natural categories
 COGNITIVE PSYCHOLOGY
, 1976
"... Categorizations which humans make of the concrete world are not arbitrary but highly determined. In taxonomies of concrete objects, there is one level of abstraction at which the most basic category cuts are made. Basic categories are those which carry the most information, possess the highest categ ..."
Abstract

Cited by 856 (1 self)
 Add to MetaCart
category cue validity, and are, thus, the most differentiated from one another. The four experiments of Part I define basic objects by demonstrating that in taxonomies of common concrete nouns in English based on class inclusion, basic objects are the most inclusive categories whose members: (a) possess
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and animated drawings; it is a general purpose system. Sketchpad has shown the most usefulness as an aid to the understanding of processes, such as the notion of linkages, which can be described with pictures. Sketchpad also makes it easy to draw highly repetitive or highly accurate drawings and to change drawings previously drawn with it. The many drawings in this thesis were all made with Sketchpad.
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties are given. We show that, if each flow augmentation is made along an augmenting path having a minimum number of arcs, then a maximum flow in an nnode network will be obtained after no more than ~(n a n) augmentations; and then we show that if each flow change is chosen to produce a maximum increase in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimumcost flow problem, in which all shortestpath computations are performed on networks with all weights nonnegative. In particular, this
Sequential data assimilation with a nonlinear quasigeostrophic model using Monte Carlo methods to forecast error statistics
 J. Geophys. Res
, 1994
"... . A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The ..."
Abstract

Cited by 782 (22 self)
 Add to MetaCart
. A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The unbounded error growth found in the extended Kalman filter, which is caused by an overly simplified closure in the error covariance equation, is completely eliminated. Open boundaries can be handled as long as the ocean model is well posed. Wellknown numerical instabilities associated with the error covariance equation are avoided because storage and evolution of the error covariance matrix itself are not needed. The results are also better than what is provided by the extended Kalman filter since there is no closure problem and the quality of the forecast error statistics therefore improves. The method should be feasible also for more sophisticated primitive equation models. The computati...
Results 1  10
of
198,898