Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Good morning,
Does anyone know about efficient algorithms for partial string matching? For example, given the two strings “woods” and “woodes”, the algorithm could/should possibly return “wood+s”, or ” | e”.
Thank you very much.
that’s a quite complex problem and named “sequence alignment problem”. do you want to implement it by yourself? for a first look wikipedia provides a nice article: http://en.wikipedia.org/wiki/Sequence_alignment