Titlebook: Combinatorial Pattern Matching; 19th Annual Symposiu Paolo Ferragina,Gad M. Landau Conference proceedings 2008 Springer-Verlag Berlin Heide

引起极大兴趣

书目名称Combinatorial Pattern Matching影响因子(影响力)




书目名称Combinatorial Pattern Matching影响因子(影响力)学科排名




书目名称Combinatorial Pattern Matching网络公开度




书目名称Combinatorial Pattern Matching网络公开度学科排名




书目名称Combinatorial Pattern Matching被引频次




书目名称Combinatorial Pattern Matching被引频次学科排名




书目名称Combinatorial Pattern Matching年度引用




书目名称Combinatorial Pattern Matching年度引用学科排名




书目名称Combinatorial Pattern Matching读者反馈




书目名称Combinatorial Pattern Matching读者反馈学科排名

BOAST

织物

The Changing Face of Web Searchst-growing revenue source for the companies that provide this service. Following a brief overview of the state of the art and how we got there, this talk covers a spectrum of technical challenges arising in web search - ranging from spam detection to auction mechanisms.

fluoroscopy

Blood-Vessels

Searching for Gapped Palindromesoth classes, we propose algorithms that run in time .(. + .), where . is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound.

projectile

projectile

Finding Largest Well-Predicted Subset of Protein Structure Modelsd, and one of the most intuitive criteria requires us to find a . — a maximum subset of the model which matches the native structure [12]. The problem is solvable in .(..) time, albeit too slow for practical usage. We present a (1 + .). distance approximation algorithm that runs in time .(..log./..)

GLIDE

Indicative

Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknotsthat, despite the problem is NP-hard, the algorithmic complexity adapts to the complexity of the RNA structures. Due to fixed parameter tractability, we can guarantee polynomial run-time for a parameter which is small in practice. Our algorithm can be considered as a generalization of the algorithm

Sinus-Rhythm

Faster Algorithm for the Set Variant of the String Barcoding Problemn strings represent a set of genomic sequences and the substrings serve as probes in a hybridisation experiment. In this paper, we study a variant of the string barcoding problem in which the substrings have to be chosen from a particular set of substrings of cardinality .. This variant can be also