Fast algorithms for finding disjoint subsequences with extremal densities

Authors:
Anders Bergkvist;Peter Damaschke
Affiliations:
Department of Molecular Biology, Göteborg University, P.O. Box 462, 40530 Göteborg, Sweden;School of Computer Science and Engineering, Chalmers University, 41296 Göteborg, Sweden
Venue:
Pattern Recognition
Year:
2006

Citing 15
Cited 2

Computing the largest empty rectangle

SIAM Journal on Computing
A note on finding a maximum empty rectangle

Discrete Applied Mathematics
Fast algorithms for computing the largest empty rectangle

SCG '87 Proceedings of the third annual symposium on Computational geometry
Dynamic programming with convexity, concavity and sparsity

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Sparse dynamic programming I: linear cost functions

Journal of the ACM (JACM)
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Progress in Selection

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Algorithms for Transposition Invariant String Matching

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Mining for empty spaces in large data sets

Theoretical Computer Science - Database theory
Powers of geometric intersection graphs and dispersion algorithms

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Discovering interesting holes in data

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Randomized algorithm for the sum selection problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved algorithms for the k maximum-sums problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Subquadratic algorithms for 3SUM

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Disjoint segments with maximum density

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Algorithms for computing the length-constrained max-score segments with applications to DNA copy number data analysis

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.01

Visualization

Abstract

The annotation of proteins can be achieved by classifying the protein of interest into a certain known protein family to induce its functional and structural features. This paper presents a new method for classifying protein sequences based upon the ...