A concurrent multi-string matching from multi-text algorithm based on the algorithm of Hamiltonian Path Problem and DNA computation

DOI10.1080/09720529.2004.10697990zbMath1101.68740OpenAlexW2319821381MaRDI QIDQ4821804

No author found.

Publication date: 21 October 2004

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2004.10697990

zbMATH Keywords

DNA computationHamiltonian path problemDNA operationsub-string matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• K-M-P string matching revisited
• Terminal pair maximal flow finding using DNA computation
• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings