Learn how to use dynamic programming algorithms for string matching in two data structures: matrix and graph. Find patterns in texts with multiple dimensions.

A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

Learn the steps to follow when you face a string problem in programming, and some tips and techniques to improve your algorithm design skills.

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

In contrast to genome assemblers that use de Bruijn graphs, those based on string graphs are able to losslessly retain information from sequence data. However, despite the advantages provided by a ...

Graph partitioning is the process of dividing a graph into multiple subgraphs or partitions, such that each subgraph is connected and has a certain desirable property, such as balanced size or minimal ...

Knowledge Graph Algorithm Update Summer 2019 (a.k.a. Budapest) In July/August 2019, two things changed with Google's Knowledge Graph API that may be a turning point both for Google and for us as ...