Finding approximate patterns in undirected acyclic graphs (Q5959618): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127065483, #quickstatements; #temporary_batch_1722702569611
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Exact and approximate algorithms for unordered tree matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate patterns in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0031-3203(01)00055-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004555680 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127065483 / rank
 
Normal rank

Latest revision as of 03:43, 4 August 2024

scientific article; zbMATH DE number 1720229
Language Label Description Also known as
English
Finding approximate patterns in undirected acyclic graphs
scientific article; zbMATH DE number 1720229

    Statements

    Identifiers