A geometric framework for solving subsequence problems in computational biology efficiently

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 310-318

  Bernholt, Thorsten ^a   Eisenbrand, Friedrich ^b   Hofmeister, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Computational biology; Minkowski sums; Quasiconvex functions; Subsequence problems

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; NUMBER THEORY; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY; MINKOWSKI SUMS; QUASICONVEX FUNCTIONS; SUBSEQUENCE PROBLEMS;

COMPUTATIONAL GEOMETRY;

EID: 35348911872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247125     Document Type: Conference Paper

References (19)

1. P. K. Agarwal, N. Amenta, and M. Sharir. Largest placement of one convex polygon inside another. Discrete & Computational Geometry, 19(1):95-104, 1998.
2. L. Allison. Longest biased interval and longest non-negative sum interval. Bioinformatics Application Note, 19(10): 1294-1295, 2003.
3. th Annual ACM Symposium on Theory of Computing (STOC '83), pages 80-86, 1983.
4. th Latin American Symposium on Theoretical Informatics(LATIN 2006), pages 178-189, 2006.
5. L. P. Chew and K. Kedem. A convex polygon among polygonal obstacles: placement and high-clearance motion. Computational Geometry, 3(2):59-89, 1993.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (Second Edition). MIT Press & McGraw-Hill, 2001.
7. P. L. Davies and A. Kovac. Local extremes, runs, strings and multiresolution (with discussion). Annals of Statistics, 29(1):1-65, 2001.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer, 1997.
9. th International Conference on Implementation and Application of Automata (CIAA 2003), pages 251-257, 2003.
10. M. H. Goldwasser, M.-Y. Kao, and H.-I. Lu. Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. Journal of Computer and System Sciences, 70(2):128-144, 2005.
11. th IEEE Symposium on the Foundations of Computer Science (FOCS '83), pages 100-111, 1983.
12. L. J. Guibas, M. Sharir, and S. Sifrony. On the general motion-planning problem with two degrees of freedom. Discrete & Computational Geometry, 4(5):491-521, 1989.
13. J. C. Latombe. Rabot Motion Planning. Kluwer, 1991.
14. Y.-L. Lin, T. Jiang, and K.-M. Chao. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. Journal of Computer and System Sciences, 65(3):570-586, 2002.
15. th International Conference on Research in Computational Molecular Biology (RECOMB 2005), pages 83-100, 2005.
16. T. Lozano-Perez and M. A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22:560-570, 1979.
17. J. Pach and P. K. Agarwal. Combinatorial geometry. Wiley-Interscience Publication, 1995.
18. E. Ramos, 2006. Personal communication.
19. nd IEEE Mediterranean Electrotechnical Conference (MELECON '83), pages A10.02/1-4, 1983.