A Space Efficient Algorithm for Sequence Alignment with Inversions

2003 ◽  
pp. 57-67 ◽  
Author(s):  
Yong Gao ◽  
Junfeng Wu ◽  
Robert Niewiadomski ◽  
Yang Wang ◽  
Zhi-Zhong Chen ◽  
...  
Keyword(s):  
Sequence Alignment ◽  
Efficient Algorithm

MSuPDA: A Memory Efficient Algorithm for Sequence Alignment

2015 ◽  
Vol 8 (1) ◽  
pp. 84-94
Author(s):  
Mohammad Ibrahim Khan ◽  
Md. Sarwar Kamal ◽  
Linkon Chowdhury
Keyword(s):  
Sequence Alignment ◽  
Efficient Algorithm ◽  
Memory Efficient

scholarly journals A space-efficient algorithm for sequence alignment with inversions and reversals

2004 ◽  
Vol 325 (3) ◽  
pp. 361-372 ◽  
Author(s):  
Zhi-Zhong Chen ◽  
Yong Gao ◽  
Guohui Lin ◽  
Robert Niewiadomski ◽  
Yang Wang ◽  
...  
Keyword(s):  
Sequence Alignment ◽  
Efficient Algorithm

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Sign in / Sign up

Export Citation Format

Share Document