Parallel Detection of All Palindromes in a String

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(94)00083-u
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

PPS: A Computing Engine to Find Palindromes in All Protein Sequences

Bioinformation
2014English

Testing String Superprimitivity in Parallel

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1994English

Locating All Maximal Approximate Runs in a String

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Nested Counters in Bit-Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Parallel String Matching Algorithm Using Grid

International Journal of Distributed and Parallel systems
2012English

Why Chromosome Palindromes?

International Journal of Evolutionary Biology
2012English

An Optimal Algorithm to Compute All the Covers of a String

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1994English

Counting All Dyons in $ \Mathcal{N} = 4 $ String Theory

Journal of High Energy Physics
High Energy PhysicsNuclear
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy