Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently
暂无分享,去创建一个
Friedrich Eisenbrand | Thomas Hofmeister | Thorsten Bernholt | T. Bernholt | F. Eisenbrand | T. Hofmeister
[1] Yonatan Aumann,et al. Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis , 2005, RECOMB.
[2] Sylvain Gravier,et al. Identifying Codes of Cartesian Product of Two Cliques of the Same Size , 2008, Electron. J. Comb..
[3] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[4] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[5] A WesleyMichael,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979 .
[6] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[7] Leonidas J. Guibas,et al. A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Hsueh-I Lu,et al. An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract , 2003, CIAA.
[9] Leonidas J. Guibas,et al. On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.
[10] P. Davies,et al. Local Extremes, Runs, Strings and Multiresolution , 2001 .
[11] Friedrich Eisenbrand,et al. Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets , 2008, Electron. J. Comb..
[12] Lloyd Allison,et al. Longest Biased Interval and Longest Non-negative Sum Interval , 2003, Bioinform..
[13] Yaw-Ling Lin,et al. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis , 2002, J. Comput. Syst. Sci..
[14] Ming-Yang Kao,et al. Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications , 2002, J. Comput. Syst. Sci..
[15] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[16] Thomas Hofmeister,et al. An Algorithm for a Generalized Maximum Subsequence Problem , 2006, LATIN.
[17] Yaw-Ling Lin,et al. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis , 2002, J. Comput. Syst. Sci..
[18] Micha Sharir,et al. Largest Placement of One Convex Polygon Inside Another , 1998, Discret. Comput. Geom..
[19] Klara Kedem,et al. A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion , 1993, Comput. Geom..
[20] Uriel G. Rothblum,et al. The convex dimension of a graph , 2007, Discret. Appl. Math..
[21] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.