Link to bioRxiv paper:
http://biorxiv.org/cgi/content/short/2023.02.05.527069v1?rss=1
Authors: Rocha, L. B., Adi, S. S., Araujo, E.
Abstract:
An important problem in Computational Biology is to map a sequence s into a sequence graph G. One way to do this mapping is to find for a walk (or path) p in G such that p spells a sequence s' most similar to s and this problem is addressed by the Graph Sequence Mapping Problem -- GSMP. In this article we consider the GSMP using De Bruijn graph and we addressed by the De Bruijn Graph Sequence Mapping Problem -- BSMP. Given a sequence s and a De Bruijn graph Gk, with k greater than or equal to 2, BSMP consists of finding a walk p in Gk such that the sequence spelled by p is the most similar to s given a distance, for example, edit distance.
Copy rights belong to original authors. Visit the link for more info
Podcast created by Paper Player, LLC
