229 search results - page 4 / 46 » Speeding Up Two String-Matching Algorithms |
BMCBI
2008
13 years 7 months ago
2008
Background: R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods ca...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Web processes must often operate in volatile environments where the quality of service parameters of the participating service providers change during the life time of the process...
FUN
2010
Springer
14 years 8 days ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
CSB
2004
IEEE
13 years 11 months ago
2004
IEEE
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
BMCBI
2008
13 years 7 months ago
2008
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...