An important problem in Computational Biology is to map a sequencesinto a sequence graphG. One way to do this mapping is to find for a walk (or path)pinGsuch thatpspells a sequences′most similar tosand this problem is addressed by the Graph Sequence Mapping Problem --GSMP. In this article we consider theGSMPusing De Bruijn graph and we addressed by the De Bruijn Graph Sequence Mapping Problem --BSMP. Given a sequencesand a De Bruijn graphGk, withk≥ 2,BSMPconsists of finding a walkpinGksuch that the sequence spelled bypis the most similar tosgiven a distance, for example, edit distance.