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

吹牛大王

NOT

新娘

inveigh

Indecisive

Vasiliki V. Georgatzi,Yeoryios Stamboulis finding the maximum alignment score for any two substrings of a single string . under the condition that the substrings do not overlap. In a biological context, this corresponds to the largest repeating region in the molecule. The algorithm runs in .. log..) time and uses only ..) space.

CLIFF

,Interdisziplinäre Produktentstehung, an improved performance guarantee. For arbitrary l

precede

https://doi.org/10.1007/978-3-031-52990-0n quadratic time and linear space. Both algorithms are implemented as portable C programs. An experiment is conducted to compare protein alingments produced by the new global alignment program with ones by an existing program.

卜闻

正常

https://doi.org/10.1007/978-981-13-6822-6n asymptotic expression, as the collection of lengths becomes large, is obtained for the savings from compression, that is, the difference between the uncompressed (concatenated) length and the optimal superstring length.

Monotonous

0302-9743 r the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years.978-3-540-58094-2978-3-540-48450-9Series ISSN 0302-9743 Series E-ISSN 1611-3349