541 search results - page 73 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
166
Voted
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
129
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
122
Voted
IPPS
2010
IEEE
15 years 4 days ago
2010
IEEE
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
132
click to vote
CCS
2009
ACM
16 years 2 months ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
136
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...