Use Regular expressions library for finding subsequence

I want to findout if a word("hello") can be made by some string (asbdhdkejdlfklo). We can take any subsequence of the above string and check if "hello" exist there. Well i can search this substring by my own logic . But i find out that there are some library functions in c++ like(Regular expressions library). I searched on the web how can i do that . But not find anything useful Information. I am a big fan of c++ .so i don't wanna use JAVA;