Generalized Uno and Yagiura’s Algorithm for Alignment Decomposition
نویسندگان
چکیده
We generalize Uno and Yagiura’s algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the two sides. Common intervals in such a setting can be interpreted as translationally equivalent phrases between two sentences. We show how to decompose an alignment into hierarchical phrase pairs in linear time.
منابع مشابه
Revisiting T. Uno and M. Yagiura's Algorithm
In 2000, T. Uno and M. Yagiura published an algorithm that computes all the K common intervals of two given permutations of length n in O(n + K) time. Our paper first presents a decomposition approach to obtain a compact encoding for common intervals of d permutations. Then, we revisit T. Uno and M. Yagiura’s algorithm to yield a linear time algorithm for finding this encoding. Besides, we adap...
متن کاملExtracting Synchronous Grammar Rules From Word-Level Alignments in Linear Time
We generalize Uno and Yagiura’s algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the two sides. We show how to maximally decompose a word-aligned sentence pair in linear time, which can be used to generate all possible phrase pairs or a Synchronous Context-Free Grammar (SCFG) with the simplest rules possible....
متن کاملIntegration Scheme for SINS/GPS System Based on Vertical Channel Decomposition and In-Motion Alignment
Accurate alignment and vertical channel instability play an important role in the strap-down inertial navigation system (SINS), especially in the case that precise navigation has to be achieved over long periods of time. Due to poor initialization as well as the cumulative errors of low-cost inertial measurement units (IMUs), initial alignment is not sufficient to achieve required navigation ac...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کامل