An Optimal Algorithm to Compute All the Covers of a String

Information Processing Letters - Netherlands
doi 10.1016/0020-0190(94)00045-x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Using a Model to Compute the Optimal Schedule of Practice.

Journal of Experimental Psychology: Applied
ExperimentalCognitive Psychology
2008English

An Optimal Algorithm for Computing All Subtree Repeats in Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

An Algorithm for String Searching

International Journal of Computer Applications
2019English

An Iterative Algorithm to Compute the Bott-Duffin Inverse and Generalized Bott-Duffin Inverse

Filomat
Mathematics
2012English

Parallel Detection of All Palindromes in a String

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1995English

Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

A Fast Algorithm to Compute Conical Pockets in Proteins. Application to the Structural Characterization of Γ -Carbonic Anhydrases

Molecular Informatics
Organic ChemistryDrug DiscoveryComputer Science ApplicationsMolecular MedicineStructural Biology
2017English

Dynamical Systems That Compute Time-Optimal Switchings

IFAC Proceedings Volumes
2001English

Locating All Maximal Approximate Runs in a String

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy