Fast algorithms for finding disjoint subsequences with extremal densities

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

Volumn 3827 LNCS, Issue , 2005, Pages 714-723

  Bergkvist, Anders ^a   Damaschke, Peter ^b  

^a UNIVERSITY OF GOTHENBURG   (Sweden)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PROBLEM SOLVING;

BIOLOGICAL DATA; DYNAMIC PROGRAMMING PROBLEMS; EXTREMAL DENSITIES; SUBQUADRATIC ALGORITHM;

ALGORITHMS;

EID: 33744955204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_72     Document Type: Conference Paper

References (20)

1. A. Aggarwal, S. Suri: Fast algorithms for computing the largest empty rectangle, Symp. on Comput. Geometry 1987, 278-290
2. G. Agnarsson, P. Damaschke, M.M. Halldórsson: Powers of geometric intersection graphs and dispersion algorithms, Discrete Applied Mathematics 132 (2003), Special Issue Stability in Graphs and Related Topics (eds. V. Lozin, D. de Werra), 3-16.
3. Preliminary version in: Proc. of SWAT 2002, LNCS 2368, 140-149
4. M.J. Attalah, G.N. Fredrickson: A note on finding a maximum empty rectangle, Discrete Applied Math. 13 (1986), 87-91
5. I. Baran, E. Demaine, M. Patrascu: Subquadratic algorithms for 3SUM, 9th WADS 2005, LNCS 3608, 409-421
6. R.D. Beger, P.H. Bolton: Protein φ and ψ dihedral restraints determined from multidimensional hypersurface correlations of backbone chemical shifts and their use in the determination of protein tertiary structures, J. of Biomol. NMR 10 (1997), 129-142
7. B. Chazelle, L.R.S. Drysdale, D.T. Lee: Computing the largest empty rectangle, SIAM J. Comp. 15 (1986), 550-555
8. Y.H. Chen, H.I. Lu, C.Y. Tang: Disjoint segments with maximum density, International Workshop on Bioinformatics Research and Applications IWBRA 2005 (within ICCS 2005), LNCS 3515, 845-850
9. G. Cornilescu, F. Delaglio, A. Bax: Protein backbone angle restraints from searching a database for chemical shift and sequence homology, manuscript 1998, http://spin.niddk.nih.gov/bax/softwara/TALOS
10. D. Dor: Selection algorithms, PhD thesis, Tel-Aviv Univ. 1995
11. J. Edmonds, J. Gryz, D. Liang, R.J. Miller: Mining for empty rectangles in large data sets, Theoretical Computer Science 296 (2003), 435-452
12. D. Eppstein, Z. Galil. R. Giancarlo, G.F. Italiano: Sparse dynamic programming I: Linear cost functions, J. of the ACM 39 (1992), 519-545
13. Z. Galil, K. Park: Dynamic programming with convexity, concavity and sparsity, Theor. Computer Science 92 (1992), 49-76
14. B. Liu, L.P. Ku, W. Hsu: Discovering interesting holes in data, 15th IJCAI'1997, 930-935
15. V. Mäkinen, G. Navarro, E. Ukkonen: Algorithms for transposition invariant string matching, 20th STACS 2003, LNCS 2607, 191-202
16. M. Orlowski: A new algorithm for the largest empty rectangle problem, Algorithmica 5 (1990), 65-73
17. M.S. Paterson: Progress in selection, 5th SWAT'96, LNCS 1097, 368-379
18. W.L. Ruzzo, M. Tompa: A linear time algorithm for finding all maximal scoring subsequences, 7th Int. Conf. Intelligent Systems for Molecular Biology 1999, AAAI, 234-241
19. Y. Wang, O. Jardetzky: Probability-based protein secondary structure identification using combined NMR chemical-shift data, Protein Science 11 (2002), 852-861
20. 13C′ chemical shifts in peptides using density functional theory, Biopolymers 65 (2002), 408-423