Sciweavers

3146 search results - page 10 / 630
» Efficient Consequence Finding
Sort
View
92
Voted
ISMB
2001
15 years 6 months ago
An efficient algorithm for finding short approximate non-tandem repeats
Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann
IPL
2010
158views more  IPL 2010»
15 years 1 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
113
Voted
TALG
2010
107views more  TALG 2010»
14 years 11 months ago
Finding equitable convex partitions of points in a polygon efficiently
John Gunnar Carlsson, Benjamin Armbruster, Yinyu Y...