Sciweavers

269 search results - page 3 / 54
» Computing the inverse sort transform in linear time
Sort
View
RECOMB
2007
Springer
14 years 7 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader

Book
19360views
15 years 6 months ago
Numerical Recipes in C
C code implementation of several math algorithms such as Linear Algebraic Equations, Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
William H. Press, Saul A. Teukolsky, William T. Ve...
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 7 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
FCT
1993
Springer
13 years 11 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
VRST
2005
ACM
14 years 28 days ago
Computing inverse kinematics with linear programming
Inverse Kinematics (IK) is a popular technique for synthesizing motions of virtual characters. In this paper, we propose a Linear Programming based IK solver (LPIK) for interactiv...
Edmond S. L. Ho, Taku Komura, Rynson W. H. Lau