Sequence-To-Graph Alignment: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:2511:25, 15 February 2023‎ Admin talk contribs‎ 1,159 bytes +1,159‎ Created page with "{{DISPLAYTITLE:Sequence-To-Graph Alignment (Sequence-to-Graph Alignment)}} == Description == This is pattern matching where you are given a pattern and a hypertext graph. The hypertext model is that the text forms a graph of $N$ nodes and $E$ edges, where a string is stored inside each node, and the edges indicate alternative texts that may follow the current node. The pattern is still a simple string of length $m$. It is also customary to transform this graph into a o..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Sequence-To-Graph_Alignment"