QQ客服 官方微博 反馈留言

	Simple tree pattern matching for trees in the prefix bar notation.
	Lahoda,Jan; Žd’árek,Jan
刊名	Discrete Applied Mathematics
	2013
卷号	Vol.163 Part 3页码:343-351
关键词	TREE graphs PATTERNS MATCHING theory GRAPH theory MACHINE theory COMPUTER algorithms ELECTRONIC information resource searching
ISSN号	0166-218X
URL标识	查看原文
公开日期	[db:dc_date_available]
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/6394913
专题	上海电子信息职业技术学院
作者单位	1 Oracle Czech, V Parku 2308/8, 148 00 Praha 4, Czech Republic 2 Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Thákurova 9, 160 00 Prague 6, Czech Republic
推荐引用方式 GB/T 7714	Lahoda,Jan,Žd’árek,Jan. Simple tree pattern matching for trees in the prefix bar notation.[J]. Discrete Applied Mathematics,2013,Vol.163 Part 3:343-351.
APA	Lahoda,Jan,&Žd’árek,Jan.(2013).Simple tree pattern matching for trees in the prefix bar notation..Discrete Applied Mathematics,Vol.163 Part 3,343-351.
MLA	Lahoda,Jan,et al."Simple tree pattern matching for trees in the prefix bar notation.".Discrete Applied Mathematics Vol.163 Part 3(2013):343-351.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。