Results 1  10
of
2,789
Programming by Expression Refinement: the KMP Algorithm
, 1990
"... Introduction We carry out a small exercise in programming by what might be called expression refinement. This is a style of formal programming in which we begin with an expression written in an expressive notation and regarded as a specification, and proceed to manipulate it into a constructive equ ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
equivalent. This leads to programs making much use of recursive functions and less use of loops. The exercise is to calculate a patternmatching algorithm, and specifically the algorithm originally due to Knuth, Morris, and Pratt [0]. We begin, however, with a smaller problem, one that turns out to be both
Using KMP Algorithm S.RAJESH Lecturer, Dept.Of Cse
"... Bioinformatics is the application of computer technology to the management and analysis of biological data. The result is that computers are being used to gather, store, analyze and merge biological data. The goal of bioinformatics is to uncover the wealth of biological information hidden in the ma ..."
Abstract
 Add to MetaCart
Words: Bio informatics, pattern matching, sequence analysis, disease identification, KMP algorithm, DNA, failure function 1.
UNUSUAL PATTERN DETECTION IN DNA DATABASE USING KMP ALGORITHM
"... Bioinformatics is the application of computer technology to the management and analysis of biological data. The result is that computers are being used to gather, store, analyze and merge biological data. The goal of bioinformatics is to uncover the wealth of biological information hidden in the ma ..."
Abstract
 Add to MetaCart
Words Bio informatics, pattern matching, sequence analysis, disease identification, KMP algorithm, DNA, failure function 1.
Parallel Search Using KMP Algorithm in Arabic String Ibrahim M. AbuZaid, Emad Kh. ElRayyes
"... In our paper we will try to implement the parallel techniques in Knuth–Morris–Pratt string searching algorithm ( KMP algorithm) for search about Arabic language text, Before that we will try to implement a Preprocessing processes in Arabic text (stemming Arabic text) to prepare the text to using it ..."
Abstract
 Add to MetaCart
In our paper we will try to implement the parallel techniques in Knuth–Morris–Pratt string searching algorithm ( KMP algorithm) for search about Arabic language text, Before that we will try to implement a Preprocessing processes in Arabic text (stemming Arabic text) to prepare the text to using
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case
Efficient randomized patternmatching algorithms
, 1987
"... We present randomized algorithms to solve the
following stringmatching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much ..."
Abstract

Cited by 397 (1 self)
 Add to MetaCart
We present randomized algorithms to solve the
following stringmatching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n
An Mary KMP classifier for multiaspect target classification
 in Proc. IEEE Int. Conf. Acoust. Speech Signal Process
"... The kernel matching pursuit (KMP) algorithm is reformulated in the framework of the theory of optimal experiments, using a weighted sum of squared errors as the loss function, and it is extended to the case of Mary target classification and kernel optimization. The Mary KMP classifier is applied ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The kernel matching pursuit (KMP) algorithm is reformulated in the framework of the theory of optimal experiments, using a weighted sum of squared errors as the loss function, and it is extended to the case of Mary target classification and kernel optimization. The Mary KMP classifier is applied
Dependent Types in Practical Programming
 In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages
, 1998
"... Programming is a notoriously errorprone process, and a great deal of evidence in practice has demonstrated that the use of a type system in a programming language can effectively detect program errors at compiletime. Moreover, some recent studies have indicated that the use of types can lead to si ..."
Abstract

Cited by 341 (38 self)
 Add to MetaCart
Programming is a notoriously errorprone process, and a great deal of evidence in practice has demonstrated that the use of a type system in a programming language can effectively detect program errors at compiletime. Moreover, some recent studies have indicated that the use of types can lead to significant enhancement of program performance at runtime. For the sake of practicality of typechecking, most type systems developed for general purpose programming languages tend to be simple and coarse, and this leaves ample room for improvement. As an advocate of types, this thesis addresses the issue of designing a type system for practical programming in which a notion of dependent types is available, leading to more accurate capture of program invariants with types. In contrast to developing a type theory with dependent types and then designing upon it a functional programming language, we study practical methods for extending the type systems of existing programming languages with dep...
A New Approach to Text Searching
"... We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with classes of symbols, don't care symbols and complement symbols, and multiple patterns. In addition we solve the same problems allowing up to k mismatches. Among the feature ..."
Abstract

Cited by 295 (14 self)
 Add to MetaCart
We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with classes of symbols, don't care symbols and complement symbols, and multiple patterns. In addition we solve the same problems allowing up to k mismatches. Among
Weaknesses in the Key Scheduling Algorithm of RC4
 PROCEEDINGS OF THE 4TH ANNUAL WORKSHOP ON SELECTED AREAS OF CRYPTOGRAPHY
, 2001
"... In this paper we present several weaknesses in the key scheduling algorithm of RC4, and describe their cryptanalytic significance. We identify a large number of weak keys, in which knowledge of a small number of key bits suffices to determine many state and output bits with nonnegligible probabilit ..."
Abstract

Cited by 257 (1 self)
 Add to MetaCart
In this paper we present several weaknesses in the key scheduling algorithm of RC4, and describe their cryptanalytic significance. We identify a large number of weak keys, in which knowledge of a small number of key bits suffices to determine many state and output bits with non
Results 1  10
of
2,789