UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

Information processing letters, 2008-11, Vol.108 (6), p.360-364

2008

Volltextzugriff (PDF)

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

Journal of Complexity, 2013-02, Vol.29 (1), p.44-52

2013

Volltextzugriff (PDF)

Dynamic programming algorithms for the mosaic longest common subsequence problem

Information processing letters, 2007-04, Vol.102 (2), p.99-103

2007

Volltextzugriff (PDF)

Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion

Journal of combinatorial optimization, 2014-11, Vol.28 (4), p.800-813

2014

Volltextzugriff (PDF)

Fast algorithms for computing the constrained LCS of run-length encoded strings

Theoretical computer science, 2012-05, Vol.432, p.1-9

2012

Volltextzugriff (PDF)

Efficient algorithms for the block edit problems

Information and computation, 2010-03, Vol.208 (3), p.221-229

2010

Volltextzugriff (PDF)

Efficient indexing algorithms for one-dimensional discretely-scaled strings

Information processing letters, 2010-07, Vol.110 (16), p.730-734

2010

Volltextzugriff (PDF)

Efficient algorithms for finding interleaving relationship between sequences

Information processing letters, 2008-02, Vol.105 (5), p.188-193

2008

Volltextzugriff (PDF)

A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures

Pattern recognition, 2000, Vol.33 (8), p.1263-1276

2000

Volltextzugriff (PDF)

A note on adaptive 2D-H strings

Pattern recognition letters, 1999, Vol.20 (1), p.15-20

1999

Volltextzugriff (PDF)

An Efficient Signature File Strategy for Similarity Retrieval from Large Iconic Image Databases

Journal of visual languages and computing, 2002-04, Vol.13 (2), p.117-147

2002

Volltextzugriff (PDF)

Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints

2011 IEEE 11th International Conference on Bioinformatics and Bioengineering, 2011, p.175-180

2011

Volltextzugriff (PDF)

1 – 12 von 12

Menü

Weitere Dienste

Einstellungen

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

Dynamic programming algorithms for the mosaic longest common subsequence problem

Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion

Fast algorithms for computing the constrained LCS of run-length encoded strings

Efficient algorithms for the block edit problems

Efficient indexing algorithms for one-dimensional discretely-scaled strings

Efficient algorithms for finding interleaving relationship between sequences

A unique-ID-based matrix strategy for efficient iconic indexing of symbolic pictures

A note on adaptive 2D-H strings

An Efficient Signature File Strategy for Similarity Retrieval from Large Iconic Image Databases

Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints

Suchergebnisse filtern