Titlebook: Combinatorial Pattern Matching; Fifth Annual Symposi Maxime Crochemore,Dan Gusfield Conference proceedings 1994 Springer-Verlag Berlin Heid

补给线

书目名称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读者反馈学科排名

运动性

The parameterized complexity of sequence alignment and consensus, the problem, such as the number of sequences to be analyzed, the length of the common subsequence, and the size of the alphabet. Lower bounds on the complexity of this basic problem imply lower bounds on a number of other sequence alignment and consensus problems. At issue in the theory of paramete

多山

Computing all suboptimal alignments in linear space,al directed acyclic graph (DAG) containing all suboptimal alignments. In this paper, we propose a method that computes such a DAG in space . to the graph size. Let . be the area of the region of the dynamicprogramming matrix bounded by the suboptimal alignments and . the maximum width of that region

G-spot

异端

A context dependent method for comparing sequences,The scheme generalizes a widely used scoring scheme. A dynamic programming algorithm is developed to compute a largest-scoring alignment of two sequences of lengths . and . in .) time and .) space. Also developed is an algorithm for computing a largest-scoring local alignment between two sequences i

废墟

废墟

,Alignment of trees — An alternative to tree edit,dered trees. The time complexity of this algorithm is .(¦..¦· s¦..· (deg(..) + deg(..)).), where ¦..¦ is the number of nodes in .. and deg(..) is the degree of .., .=1,2. The algorithm is faster than the best known algorithm for tree edit when deg(..) and deg(..) are smaller than the depths of .. an

消灭

Parametric recomputing in alignment graphs, and gaps. Inappropriate choice of parameters causes irrelevant matches (“noise”) to be reported, thus obscuring biologically relevant matches. In practice, biologists frequently compare sequences in a few iterations, starting from a vague idea about appropriate parameters, then refining parameters

enchant

arsenal

A text compression scheme that allows fast searching directly in the compressed file,ile directly. The scheme requires no modification of the string-matching algorithm, which is used as a black box; any string-matching procedure can be used. Instead, the . is modified; only the outcome of the matching of the modified pattern against the compressed file is decompressed. Since the com