List:Problem Families
Jump to navigation
Jump to search
Bioinformatics
- All Maximal Non-Branching Paths in a Graph
- Cyclic Peptide Sequencing Problem
- De Novo Genome Assembly
- Motif Search
- Sequence Alignment
- d-Neighborhood of a String
Combinatorics
- AST to Code Translation
- All-Pairs Shortest Paths (APSP)
- Change-Making Problem
- Clique Problems
- Constructing Eulerian Trails in a Graph
- Constructing Suffix Trees
- Cycle Detection
- DFA Minimization
- Delaunay Triangulation
- Entity Resolution
- Finding Frequent Itemsets
- Frequent Words with Mismatches Problem
- Graph Coloring
- Graph Edit Distance Computation
- Graph Isomorphism Problem
- Graph Realization Problems
- Link Analysis
- Longest Common Subsequence
- Longest Palindromic Substring
- Longest Path Problem
- Lowest Common Ancestor
- Matrix Chain Multiplication
- Matrix Product
- Maximum Cardinality Matching
- Maximum Cut
- Maximum Flow
- Maximum Subarray Problem
- Maximum-Weight Matching
- Median String Problem
- Minimum Spanning Tree (MST)
- Minimum value in each row of an implicitly-defined totally monotone matrix
- NFA to DFA conversion
- Nearest Neighbor Search
- Optimal Binary Search Trees
- Rod-Cutting Problem
- Self-Balancing Trees Creation
- Self-Balancing Trees Deletion
- Self-Balancing Trees Insertion
- Self-Balancing Trees Search
- Sequence-to-Graph Alignment
- Shortest Path (Directed Graphs)
- Sorting
- Stable Matching Problem
- String Search
- Strongly Connected Components
- The Set-Covering Problem
- The Subset-Sum Problem
- The Traveling-Salesman Problem
- The Vertex Cover Problem
- Topological Sorting
- Tower of Hanoi
- Transitive Reduction Problem
- Turnpike Problem
- Voronoi Diagrams
- Wiener Index
- kth Order Statistic
- n-Queens Problem
Databases
Image Processing
- Closest Pair Problem
- Convex Hull
- Culling
- Data Compression
- Feature Detection
- Image Compositing
- Image Segmentation
- Line Clipping
- Line Drawing
- Line Simplification
- Line segment intersection
- Mesh Parameterization
- Mesh Simplification
- Point-in-Polygon
- Polygon Clipping
- Rasterization
- Ray Tracing
- Shown Surface Determination
- Texture Mapping
- Texture Synthesis
Numerical Analysis
- All Permutations
- Cardinality Estimation
- Convex Optimization (Non-linear)
- Coset Enumeration
- Determinant of Matrices with Integer Entries
- Eigenvalues (Iterative Methods)
- Factorization of Polynomials Over Finite Fields
- Generating Random Permutations
- Gröbner Bases
- Hyperbolic Spline Interpolation
- Integer Factoring
- Integer Relation
- Integral Equations
- LU Decomposition
- Linear Programming
- Linear System
- Maximum Likelihood Parameters
- Multiplication
- Poisson Problem
- Polynomial Interpolation
- Root Computation
- SDD Systems Solvers
- Solutions to Nonlinear Equations
- Variance Calculations
Operating Systems
- Clock Synchronization in Distributed Systems
- Deadlock Avoidance
- Disk Scheduling
- Distributed Locking Algorithms
- Interval Scheduling
- Mutual Exclusion
- Page Replacements
- Recovery
- Register Allocation
Robotics
- Informed Search
- Nash Equilibria
- Occupancy Grid Mapping
- Optimal Policies for MDPs
- POMDPs
- SLAM Algorithms
- Texture Mapping
Signal Processing
Statistics
- Filtering Problem (Stochastic Processes)
- Greatest Common Divisor
- Logarithm Calculations
- Maximum Likelihood Methods in Unknown Latent Variables
- The Frequent Words Problem