Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

COMPGEOM
2007
ACM

favoriteEmaildiscussreport

96views Discrete Geometry» more COMPGEOM 2007»

A geometric framework for solving subsequence problems in computational biology efficiently

13 years 8 months ago

A geometric framework for solving subsequence problems in computational biology efficiently

Download www2.math.uni-paderborn.de

Thorsten Bernholt, Friedrich Eisenbrand, Thomas Ho

Real-time Traffic

COMPGEOM 2007 | Discrete Geometry |

claim paper

Related Content

» A New Efficient Algorithm for Computing the Longest Common Subsequence

» Geometric Chemotaxis A BiologicallyInspired Framework for a Class of Wireless Coverage Pro...

» Algorithms for computing variants of the longest common subsequence problem

» Solving quadratically constrained geometrical problems using lagrangian duality

» Parallel Biological Sequence Comparison Using Prefix Computations

» Geometric algorithms for the analysis of 2Delectrophoresis gels

» BioGraphE highperformance bionetwork analysis using the Biological Graph Environment

» A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation

» Quasiconvex Optimization for Robust Geometric Reconstruction

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	COMPGEOM
Authors	Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister

Comments (0)