Amanote Research

Amanote Research

    RegisterSign In

Finding All Occurrences of a Pattern by a Genetic Algorithm Based Divide-And-Conquer Method

International Journal of Computer Applications
doi 10.5120/10737-5614
Full Text
Open PDF
Abstract

Available in full text

Date

February 15, 2013

Authors
Sagnik BanerjeeTamal ChakrabartiDevadatta Sinha
Publisher

Foundation of Computer Science


Related search

A Divide-And-Conquer Method for the Takagi Factorization

SIAM Journal on Matrix Analysis and Applications
Analysis
2008English

Kart: A Divide-And-Conquer Algorithm for NGS Read Alignment

Bioinformatics
StatisticsProbabilityMolecular BiologyBiochemistryComputational TheoryComputer Science ApplicationsMathematicsComputational Mathematics
2017English

Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem

SIAM Journal on Matrix Analysis and Applications
Analysis
1994English

Divide and Conquer

1993English

Divide and Conquer

2018English

Quick Knowledge Reduction Based on Divide and Conquer Method in Huge Data Sets

English

Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2012English

Divide-And-Conquer Algorithms for Multiprocessors

English

A Divide-And-Conquer Hole-Filling Method for Handling Disocclusion in Single-View Rendering

Multimedia Tools and Applications
Media TechnologyComputer NetworksHardwareCommunicationsArchitectureSoftware
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy