New in Nexus: Bidirectional FM-index for bidirectional traversal down/upstream neighbourhoods can be visualized efficiently using traversal Search schemes for lossless approximate pattern matching (separate talk) query -> candidate matches -> graph paths -> read paths Lossless aligner; reports many more occurrences than PuffAligner, although this does make it slower for >0 edit distance checkpoints k-mers inside long nodes this way, to find the start of a long (compressed) node goes down significantly. Map kmers into a hashtable storing at each index: count of kmers mapping here the last character of the kmer the index of the preceding kmer VeChat: correcting errors in long reads using variation graphs, Alexander Schönhuth Link to heading