Directed Graph Pattern Matching and Topological Embedding
โ Scribed by James Jianghai Fu
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 196 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
โฆ Synopsis
Pattern matching in directed graphs is a natural extension of pattern matching in trees and has many applications to different areas. In this paper, we study several pattern matching problems in ordered labeled directed graphs. For the rooted directed graph pattern matching problem, we present an efficient algorithm which, ลฝ< < < < given a pattern graph P and a target graph T, runs in time and space O E V
๐ SIMILAR VOLUMES
## Background Archival formalin-fixed paraffin-embedded (FFPE) tissues have limited utility in applications involving analysis of gene expression due to mRNA degradation and modification during fixation and processing. This study analyzed 160 miRNAs in paired snap frozen and FFPE cells to investiga