Efficient parallel algorithms for string editing and related problems
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Perspectives of Monge properties in optimization
TL;DR: This paper presents a survey on Monge matrices and related Monge properties and their role in combinatorial optimization, and deals with the following three main topics: fundamental combinatorsial properties of Monge structures, applications of MonGE properties to optimization problems and recognition ofMonge properties.
351
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
TL;DR: This work builds a data structure that supports O(mn log m) time queries about the weight of any of the O(m2n) best paths from the vertices in column 0 of the graph to all other vertices, and presents a simple O(n2 log n) time and $\Theta(n^2)$ space algorithm to find all approximate tandem repeats xy within a string of size n.
156
Trademark shapes description by string-matching techniques
TL;DR: The results are encouraging and point to the feasibility of the task undertaken by using the proposed approach, articulated in two stages: chain-coding the objects' contours, and applying string distances to the coded contours.
127
A fast parallel algorithm for finding the longest common sequence of multiple biosequences
Yixin Chen,Andrew Wan,Wei Liu +2 more
TL;DR: A parallel algorithm named FAST_LCS to speedup the computation for finding LCS on an MPP parallel computing model is presented and Experimental results support the analysis by showing significant improvement of the proposed method over other leading LCS algorithms.
Parallel biological sequence comparison using prefix computations
TL;DR: This paper presents practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences, both constant and affine gap penalty functions, full-sequence and subsequence matching, and space-saving algorithms.
84
References
A general method applicable to the search for similarities in the amino acid sequence of two proteins
TL;DR: A computer adaptable method for finding similarities in the amino acid sequences of two proteins has been developed and it is possible to determine whether significant homology exists between the proteins to trace their possible evolutionary development.
13.2K
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K