Computing maximum-scoring segments in almost linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4112 LNCS, Issue , 2006, Pages 255-264

  Bengtsson, Fredrik ^a   Chen, Jingsen ^a  

^a LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; DNA SEQUENCES; OPTIMIZATION; PROBLEM SOLVING;

DISJOINT-SET DATA STRUCTURES; INVERSE ACKERMANN FUNCTIONS; LINEAR-TIME ALGORITHMS;

DATA REDUCTION;

EID: 33749543482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11809678_28     Document Type: Conference Paper

References (16)

1. Csurös, M.: Maximum-scoring segment sets. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(4) (2004) 139-150
2. Fariselli, P., Finelli, M., Marchignoli, D., Martelli, P., Rossi, I., Casadio, R.: Maxsubseq: An algorithm for segment-length optimization. The case study of the transmembrane spanning segments. Bioinformatics 19 (2003) 500-505
3. Huang, X.: An algorithm for identifying regions of a DNA sequence that satisfy a content requirement. Computer Applications in the Biosciences 10 (1994) 219-225
4. Auger, I.E., Lawrence, C.E.: Algorithms for the optimal identification of segment neighbourhoods. Bulletin of Mathematical Biology 51(1) (1989) 39-54
5. Bement, T.R., Waterman, M.S.: Locating maximum variance segments in sequential data. Mathematical Geology 9(1) (1977) 55-61
6. Bentley, J.L.: Programming pearls: Algorithm design techniques. Communications of the ACM 27 (1984) 865-871
7. Bentley, J.L.: Programming pearls: Perspective on performance. Communications of the ACM 27 (1984) 1087-1092
8. Smith, D.: Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming 8 (1987) 213-229
9. Bae, S.E., Takaoka, T.: Algorithms for the problem of k maximum sums and a VLSI algorithm for the k maximum subarrays problem. In: Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks. (2004) 247-253
10. Bae, S.E., Takaoka, T.: Improved algorithms for the k-maximum subarray problem for small k. In: Proceedings of the 11th Annual International Conference on Computing and Combinatorics. Volume 3595 of LNCS. (2005) 621-631
11. Bengtsson, F., Chen, J.: Efficient algorithms for k maximum sums. In: Proceedings of the 15th Annual International Symposium Algorithms and Computation. Volume 3341 of LNCS. (2004) 137-148 Revised version to appear in Algorithmica.
12. Lin, T.C., Lee, D.T.: Randomized algorithm for the sum selection problem. In: In Proceedings of the 16th Annual Internatinal Symposium on Algorithms and Computation. Volume 3827 of LNCS. (2005) 515-523
13. Bergkvist, A., Damaschke, P.: Fast algorithms for finding disjoint subsequences with extremal densities. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation. Volume 3827 of LNCS. (2005) 714-723
14. Chung, K.M., Lu, H.I.: An optimal algorithm for the maximum-density segment problem. In: Proceedings of 11th Annual European Symposium on Algorithms. Volume 2832 of LNCS. (2003) 136-147
15. Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. In: Proceedings of the 7th Annual International Conference on Intelligent Systems for Molecular Biology. (1999) 234-241
16. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press (1990)