论文信息 - Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints

Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints

In this paper we present efficient algorithmic techniques for identifying several types of sequence-related patterns. We consider two main problems: finding a maximum weight contiguous subsequence which has the structure of a permutation with repetitions, and an online problem consisting of the constrained guessing of a secret sequence.

Nicolae Tapus | Mugurel Ionut Andreica | Andrei Grigorean

[1] Nicolae Tapus,et al. Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling , 2008, 2008 International Symposium on Parallel and Distributed Computing.

[2] Zvi Galil,et al. Data structures and algorithms for disjoint set union problems , 1991, CSUR.

[3] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .

[4] M. Sadeghi,et al. Genetic algorithm for dyad pattern finding in DNA sequences. , 2009, Genes & genetic systems.

[5] Kurt Mehlhorn,et al. A Lower Bound for the Complexity of the Union-Split-Find Problem , 1987, ICALP.

[6] Ker-I Ko,et al. On the Number of Queries Necessary to Identify a Permutation , 1986, J. Algorithms.

[7] Michiel H. M. Smid,et al. Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization , 1995, J. Algorithms.

[8] Robert E. Tarjan,et al. A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[9] Robert E. Tarjan,et al. Scaling and related techniques for geometry problems , 1984, STOC '84.

[10] Mark H. Overmars,et al. Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.

[11] Michael A. Bender,et al. The LCA Problem Revisited , 2000, LATIN.

[12] R. Poli,et al. Cycle Crossover for Permutations with Repetitions Application to Graph Partitioning Technical Report CSM-454 , 2006 .