Skip to main content
Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Finding maximal exact matches in graphs

Fig. 1

Substring \(\texttt{ACCGTA}\) (underlined) with left-extension \(\{\texttt{A},\texttt{C}\}\) and right-extension \(\{\texttt{G}\}\), and substring GGAACC (underlined, bold edge) with left-extension \(\{\texttt{T}\}\) and right-extension \(\{\texttt{A}\}\)

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188