Keyphrases
Linear Time
71%
Evolutionary Tree
64%
Planar Graph
61%
Approximation Algorithms
50%
Separator
46%
Parallel Algorithm
41%
Self-assembly
40%
Depth-first Search
36%
Online Algorithms
35%
Wormhole
32%
Tight
32%
Directed Graph
32%
Competitive Ratio
31%
Polynomial Time
31%
Time Algorithm
30%
Tiling Set
28%
Bioinformatics
28%
Randomized Algorithms
28%
DNA Words
27%
Constraint Set
27%
Approximation Ratio
26%
Optimal Algorithm
26%
Motif Discovery
26%
Multiple Sequences
26%
Hypercube
26%
Short DNA
26%
Log-log
25%
Time Complexity
25%
High Probability
24%
Linear-time Algorithm
23%
Linear Invariants
22%
NP-hard
22%
Maximum Weight Matching
22%
Maximum Agreement Subtree
22%
Tile Complexity
21%
Polynomial-time Algorithm
21%
Parallel Random Access Machine
21%
Labeled Trees
19%
Multi-object
19%
Multi-connectivity
19%
Optimal Bidding Strategy
19%
Bidders
19%
NC Algorithms
19%
Tiling Systems
18%
Probabilistic Model
18%
Digraph
17%
Dynamic Programming Algorithm
17%
Strongly Connected Components
17%
Optimization Problem
17%
Input Sequence
16%
Computer Science
Approximation Algorithms
67%
Polynomial Time
59%
Directed Graphs
53%
on-line algorithm
51%
Efficient Algorithm
49%
Sensitive Informations
46%
Optimal Algorithm
46%
Time Complexity
46%
Planar Graph
45%
Parallel Algorithms
41%
Randomized Algorithm
39%
Optimization Problem
34%
Approximation (Algorithm)
32%
Common Practice
30%
Hypercube
30%
Feasible Value
29%
Bipartite Graph
28%
Maximum Weight Matching
27%
Competitive Ratio
27%
Parallel Depth
26%
bipartite matching
26%
Approximation Ratio
25%
Random Access
22%
Real Number
21%
Design Problem
19%
polynomial-time algorithm
19%
digraph
19%
Dimensional Hypercube
19%
Linear Combination
19%
Genetic Algorithm
19%
Routing Algorithm
19%
Coding Theory
19%
Parameter Value
19%
Speed-up
18%
Computer Science
17%
Discovery Program
16%
Constant Factor
16%
dna computing
16%
Strongly Connected Component
16%
Quadratic Time
15%
Shared Memories
15%
Hamming Distance
15%
Connected Component
14%
Monte Carlo Simulation
14%
NP-completeness
14%
Vertex Connectivity
13%
Constraint Parameter
13%
Transitive Closure
13%
Irrational Number
13%
Traffic Monitoring
13%
Mathematics
Linear Time
100%
Edge
90%
Probability Theory
51%
Polynomial Time
45%
Planar Graph
44%
Worst Case
33%
Competitive Ratio
28%
Approximates
27%
Real Number
21%
Polynomial
21%
Minimizes
20%
Approximability
19%
Stock Market
19%
Directed Cycle
19%
Connected Component
18%
Integer
16%
Higher Dimensions
16%
Lower and upper bounds
15%
Subsequence
14%
Open Question
14%
Straight Line
14%
Maximum Degree
13%
Summation
13%
Fast Algorithm
13%
Conditional Expectation
13%
Probability Distribution
13%
Linear Combination
13%
Exponential Time
13%
Monte Carlo
13%
Fundamental Correspondence
13%
Natural Generalization
13%
Adjacency
13%
Unknown Environment
13%
Straightforward Implementation
13%
Concave Function
13%
Tree Contraction
13%
Secondary Structure
13%
Finite Time
13%
Pseudoknot
13%
Lattices
13%
Closed Form Solution
13%
Test Set
13%
Nearest Neighbour
13%
Cube
13%
Traveling Salesman Problem
13%
Path Problem
13%
Random Order
13%
Stochastic Game
13%
Universal Cover
13%
Distinct Value
13%
