D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano. Efficient algorithms for sequence analysis. In R. M. Capocelli, editor, Proc. Sequences II: Combinatorics, Compression, Security, Transmission, pages 225--244. Springer-Verlag, 1991. Also appeared as Technical Report 11216-910513-009, AT&T Bell Laboratories, Murray Hill, NJ, USA. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
An overview of the Italian National Project on "Algorithms.. - Ausiello, d'Amore (Correct)
.... Several efficient sequential and parallel algorithms have been obtained for the construction of such data structures [277, 279, 280, 278, 282, 281] New algorithmic techniques for dynamic programming problems, with applications to sequence alignments in molecular biology, have been described in [208, 210, 209, 214, 215, 276]. Parallel algorithms for many of the above problems have been developed in [35, 36, 33, 28, 25, 42, 32, 38, 37, 40, 27, 34, 30, 31, 26, 41, 29] 3.3 Traces Traces theory studies the subsets of free partially commutative monoids (trace languages) This theory has been introduced in order to ....
D. Eppstein, Z. Galil, R. Giancarlo, and G. Italiano. Efficient algorithms for sequence analysis. In R. M. Capocelli, editor, Proc. Sequences II: Combinatorics, Compression, Security, Transmission, pages 225--244. Springer-Verlag, 1991. Also appeared as Technical Report 11216-910513-009, AT&T Bell Laboratories, Murray Hill, NJ, USA.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC