Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient algorithms for similarity search

From MaRDI portal
Publication:5935742
Jump to:navigation, search

DOI10.1023/A:1009897903540zbMath1028.92008OpenAlexW1989041502MaRDI QIDQ5935742

No author found.

Publication date: 7 January 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009897903540


zbMATH Keywords

color set sizeCSSgeneralized suffix typeGSTquick sortradix sort


Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Search theory (90B40) Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20)


Related Items (2)

DCA based algorithms for multiple sequence alignment (MSA) ⋮ Mathematical programming strategies for solving the minimum common string partition problem







This page was built for publication: Efficient algorithms for similarity search

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5935742&oldid=12081237"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki