Search results for "Subtree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Ross Atkins, Colin McDiarmid	Extremal Distances for Subtree Transfer Operations in Binary Trees.	CoRR	2015	DBLP BibTeX RDF
18	Chris Whidden, Frederick A. Matsen IV	Calculating the Unrooted Subtree Prune-and-Regraft Distance.	CoRR	2015	DBLP BibTeX RDF
18	Yantao Liu, Yasser Morgan	Efficient combination of polynomial time algorithm and subtree decomposition for network coding.	IET Commun.	2015	DBLP DOI BibTeX RDF
18	Ziyang Chen, Jia Liu, Xingmin Zhao, Junfeng Zhou	Efficient subtree results computation for XML keyword queries.	Frontiers Comput. Sci.	2015	DBLP DOI BibTeX RDF
18	Pascal Welke, Tamás Horváth 0001, Stefan Wrobel	Probabilistic Frequent Subtree Kernels.	NFMCP	2015	DBLP DOI BibTeX RDF
18	Natalie Schluter	Maximising Spanning Subtree Scores for Parsing Tree Approximations of Semantic Dependency Digraphs.	IWPT	2015	DBLP DOI BibTeX RDF
18	Lu Bai 0001, Luca Rossi 0004, Zhihong Zhang 0001, Edwin R. Hancock	An Aligned Subtree Kernel for Weighted Graphs.	ICML	2015	DBLP BibTeX RDF
18	Akshay Deepak, David Fernández-Baca, Srikanta Tirthapura, Michael J. Sanderson, Michelle M. McMahon	EvoMiner: frequent subtree mining in phylogenetic databases.	Knowl. Inf. Syst.	2014	DBLP DOI BibTeX RDF
18	Ali Shahbazi, James Miller 0001	Extended Subtree: A New SimilarityFunction for Tree Structured Data.	IEEE Trans. Knowl. Data Eng.	2014	DBLP DOI BibTeX RDF
18	Daniel Irving Bernstein, Lam Si Tung Ho, Colby Long, Mike A. Steel, Katherine St. John, Seth Sullivant	Bounds on the Expected Size of the Maximum Agreement Subtree.	CoRR	2014	DBLP BibTeX RDF
18	László A. Székely, Hua Wang	Extremal values of ratios: Distance problems vs. subtree problems in trees II.	Discret. Math.	2014	DBLP DOI BibTeX RDF
18	John Haslegrave	Extremal results on average subtree density of series-reduced trees.	J. Comb. Theory, Ser. B	2014	DBLP DOI BibTeX RDF
18	Mo Shen, Daisuke Kawahara, Sadao Kurohashi	Dependency Parse Reranking with Rich Subtree Features.	IEEE ACM Trans. Audio Speech Lang. Process.	2014	DBLP DOI BibTeX RDF
18	Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel	Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay.	ISAAC	2014	DBLP DOI BibTeX RDF
18	Samini Subramaniam, Su-Cheng Haw, Lay-Ki Soon	ReLab: A subtree based labeling scheme for efficient XML query processing.	ISTT	2014	DBLP DOI BibTeX RDF
18	Sara Cohen, Nerya Or	A general algorithm for subtree similarity-search.	ICDE	2014	DBLP DOI BibTeX RDF
18	Alberto Cano 0001, Sebastián Ventura	GPU-parallel subtree interpreter for genetic programming.	GECCO	2014	DBLP DOI BibTeX RDF
18	Pascal Welke, Tamás Horváth 0001, Stefan Wrobel	On the Complexity of Frequent Subtree Mining in Very Simple Structures.	ILP	2014	DBLP DOI BibTeX RDF
18	László A. Székely, Hua Wang	Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees.	Electron. J. Comb.	2013	DBLP DOI BibTeX RDF
18	Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson	Unrooted unordered homeomorphic subtree alignment of RNA trees.	Algorithms Mol. Biol.	2013	DBLP DOI BibTeX RDF
18	Daniel M. Martin, Bhalchandra D. Thatte	The maximum agreement subtree problem.	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
18	Mehmet Tan, Faruk Polat, Reda Alhajj	Subtree selection in kernels for graph classification.	Int. J. Data Min. Bioinform.	2013	DBLP DOI BibTeX RDF
18	Hong Huang, Yongji Li	MASTtreedist: Visualization of Tree Space Based on Maximum Agreement Subtree.	J. Comput. Biol.	2013	DBLP DOI BibTeX RDF
18	Issei Hamada, Takaharu Shimada, Daiki Nakata, Kouichi Hirata, Tetsuji Kuboyama	Agreement Subtree Mapping Kernel for Phylogenetic Trees.	JSAI-isAI Workshops	2013	DBLP DOI BibTeX RDF
18	Hae-Sung Eom, Yo-Sub Han, Sang-Ki Ko	State Complexity of Subtree-Free Regular Tree Languages.	DCFS	2013	DBLP DOI BibTeX RDF
18	Sara Cohen	Indexing for subtree similarity-search using edit distance.	SIGMOD Conference	2013	DBLP DOI BibTeX RDF
18	Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu	On the Complexity of Finding a Largest Common Subtree of Bounded Degree.	FCT	2013	DBLP DOI BibTeX RDF
18	Marcin Maleszka, Ngoc Thanh Nguyen 0001	Using Subtree Agreement for Complex Tree Integration Tasks.	ACIIDS (2)	2013	DBLP DOI BibTeX RDF
18	Tomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis	An Optimal Algorithm for Computing All Subtree Repeats in Trees.	IWOCA	2013	DBLP DOI BibTeX RDF
18	Hajime Morita, Ryohei Sasano, Hiroya Takamura, Manabu Okumura	Subtree Extractive Summarization via Submodular Maximization.	ACL (1)	2013	DBLP BibTeX RDF
18	Yangjun Chen, Yibin Chen	Subtree Reconstruction, Query Node Intervals and Tree Pattern Query Evaluation.	J. Inf. Sci. Eng.	2012	DBLP BibTeX RDF
18	Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis	Computing all subtree repeats in ordered trees.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
18	Michael Fuchs 0001	Limit Theorems for Subtree Size Profiles of Increasing Trees.	Comb. Probab. Comput.	2012	DBLP DOI BibTeX RDF
18	Viet Anh Nguyen, Koichiro Doi, Akihiro Yamamoto	Efficient Mining of Closed Tree Patterns from Large Tree Databases with Subtree Constraint.	Int. J. Artif. Intell. Tools	2012	DBLP DOI BibTeX RDF
18	Zhipeng Tan, Wei Zhou 0013, Jianliang Sun, Tian Zhan, Jie Cui	An Improvement of Static Subtree Partitioning in Metadata Server Cluster.	Int. J. Distributed Sens. Networks	2012	DBLP DOI BibTeX RDF
18	Bin Li 0015, Xingquan Zhu 0001, Lianhua Chi, Chengqi Zhang	Nested Subtree Hash Kernels for Large-Scale Graph Classification over Streams.	ICDM	2012	DBLP DOI BibTeX RDF
18	Fatemeh Mokhtari, Shahab K. Bakhtiari, Gholam-Ali Hossein-Zadeh, Hamid Soltanian-Zadeh	Discriminating between brain rest and attention states using fMRI connectivity graphs and subtree SVM.	Medical Imaging: Image Processing	2012	DBLP DOI BibTeX RDF
18	Takahiro Hokazono, Tomohiro Kan, Yoshiyuki Yamamoto, Kouichi Hirata	An Isolated-Subtree Inclusion for Unordered Trees.	IIAI-AAI	2012	DBLP DOI BibTeX RDF
18	Salvatore Ruggieri	Subtree Replacement in Decision Tree Simplification.	SDM	2012	DBLP DOI BibTeX RDF
18	Songlin Wang, Yihong Hong, Jianwu Yang	XML Document Classification Using Closed Frequent Subtree.	WAIM Workshops	2012	DBLP DOI BibTeX RDF
18	Ngo Xuan Bach, Nguyen Le Minh 0001, Akira Shimazu	A Reranking Model for Discourse Segmentation using Subtree Features.	SIGDIAL Conference	2012	DBLP BibTeX RDF
18	Richárd Farkas, Helmut Schmid	Forest Reranking through Subtree Ranking.	EMNLP-CoNLL	2012	DBLP BibTeX RDF
18	Mo Shen, Daisuke Kawahara, Sadao Kurohashi	A Reranking Approach for Dependency Parsing with Variable-sized Subtree Features.	PACLIC	2012	DBLP BibTeX RDF
18	Hao Chen, Guangchun Luo, Ke Qin, Ningduo Peng, Wen Hao	An Algorithm for Partitioning a Tree Into Sibling Subtree Clusters Weighted in a Given Range.	PDCAT	2012	DBLP DOI BibTeX RDF
18	Zhi-Hong Deng, Ning Gao, Xiaoran Xu	Mop: An Efficient Algorithm for Mining Frequent Pattern with Subtree Traversing.	Fundam. Informaticae	2011	DBLP DOI BibTeX RDF
18	Peter Roelse	Erratum to: Dynamic subtree tracing and its application in pay-TV systems.	Int. J. Inf. Sec.	2011	DBLP DOI BibTeX RDF
18	Peter Roelse	Dynamic subtree tracing and its application in pay-TV systems.	Int. J. Inf. Sec.	2011	DBLP DOI BibTeX RDF
18	Sridhar Radhakrishnan, Shankar M. Banik, Venkatesh Sarangan, Chandra N. Sekharan	Delay Constrained Subtree Homeomorphism Problem with Applications.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF
18	Nikolaus Augsten, Denilson Barbosa 0001, Michael H. Böhlen, Themis Palpanas	Efficient Top-k Approximate Subtree Matching in Small Memory.	IEEE Trans. Knowl. Data Eng.	2011	DBLP DOI BibTeX RDF
18	Jong-Seok Lee, Dan Zhu	When Costs Are Unequal and Unknown: A Subtree Grafting Approach for Unbalanced Data Classification.	Decis. Sci.	2011	DBLP DOI BibTeX RDF
18	Leonardo Trujillo	Genetic programming with one-point crossover and subtree mutation for effective problem solving and bloat control.	Soft Comput.	2011	DBLP DOI BibTeX RDF
18	Danny Hermelin, Dror Rawitz	Optimization problems in multiple subtree graphs.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
18	Wei Liu 0010, Ling Chen 0005	An Efficient Way of Frequent Embedded Subtree Mining on Biological Data.	J. Comput.	2011	DBLP DOI BibTeX RDF
18	Lavanya Kannan, Hua Li, Arcady R. Mushegian	A Polynomial-Time Algorithm Computing Lower and Upper Bounds of the Rooted Subtree Prune and Regraft Distance.	J. Comput. Biol.	2011	DBLP DOI BibTeX RDF
18	Toshiaki Nakazawa, Sadao Kurohashi	Bayesian Subtree Alignment Model based on Dependency Trees.	IJCNLP	2011	DBLP BibTeX RDF
18	Martin Plicka, Jan Janousek, Borivoj Melichar	Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees.	FedCSIS	2011	DBLP BibTeX RDF
18	Minh Le Nguyen 0001, Akira Shimazu	Improving Subtree-Based Question Classification Classifiers with Word-Cluster Models.	NLDB	2011	DBLP DOI BibTeX RDF
18	Michael Fuchs 0001	The Subtree Size Profile of Plane-oriented Recursive Trees.	ANALCO	2011	DBLP DOI BibTeX RDF
18	Gideon Kotzé	Finding statistically motivated features influencing subtree alignment performance.	NODALIDA	2011	DBLP BibTeX RDF
18	Nguyen Quang Uy, Eoin Murphy, Michael O'Neill 0001, Nguyen Xuan Hoai	Semantic-Based Subtree Crossover Applied to Dynamic Problems.	KSE	2011	DBLP DOI BibTeX RDF
18	Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis	Computing All Subtree Repeats in Ordered Ranked Trees.	SPIRE	2011	DBLP DOI BibTeX RDF
18	Martti Hamina, Matti Peltola	Some Structural Properties of a Least Central Subtree of a Tree.	Algorithmic Oper. Res.	2010	DBLP BibTeX RDF
18	Florian Dennert, Rudolf Grübel	On the Subtree Size Profile of Binary Search trees.	Comb. Probab. Comput.	2010	DBLP DOI BibTeX RDF
18	Sun-Yuan Hsieh, Ting-Yu Chou	The weight-constrained maximum-density subtree problem and related problems in trees.	J. Supercomput.	2010	DBLP DOI BibTeX RDF
18	Tomás Flouri, Jan Janousek, Borivoj Melichar	Subtree matching by pushdown automata.	Comput. Sci. Inf. Syst.	2010	DBLP DOI BibTeX RDF
18	Ki Hoon Shin, Hyunchul Kang	Subtree-based XML Storage and XPath Processing.	KSII Trans. Internet Inf. Syst.	2010	DBLP DOI BibTeX RDF
18	Yukun Cheng, Liying Kang, Changhong Lu	The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
18	Joachim Spoerhase	An Optimal Algorithm for the Indirect Covering Subtree Problem	CoRR	2010	DBLP BibTeX RDF
18	Xudong Lin 0002, Ning Wang 0024, De Xu, Xiaoning Zeng	A novel XML keyword query approach using entity subtree.	J. Syst. Softw.	2010	DBLP DOI BibTeX RDF
18	Anna S. Lladó, Susana-Clara López, Jordi Moragas	Every tree is a large subtree of a tree that decomposes Kn or Kn, n.	Discret. Math.	2010	DBLP DOI BibTeX RDF
18	Andrew Vince, Hua Wang 0003	The average order of a subtree of a tree.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
18	Joachim Spoerhase	An Optimal Algorithm for the Indirect Covering Subtree Problem.	CTW	2010	DBLP BibTeX RDF
18	Nikolaus Augsten, Denilson Barbosa 0001, Michael H. Böhlen, Themis Palpanas	TASM: Top-k Approximate Subtree Matching.	ICDE	2010	DBLP DOI BibTeX RDF
18	Zhenyu Hu, Fuchun Sun 0001	Measuring similarity of web pages on maximum isomorphic subtree.	FSKD	2010	DBLP DOI BibTeX RDF
18	Mingming Zhang, Shinichiro Omachi	Indexing Tree and Subtree by Using a Structure Network.	SSPR/SPR	2010	DBLP DOI BibTeX RDF
18	Wenliang Chen, Jun'ichi Kazama, Kentaro Torisawa	Bitext Dependency Parsing with Bilingual Subtree Constraints.	ACL	2010	DBLP BibTeX RDF
18	K. Viswanathan Iyer, S. Prasanna	A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
18	David Eppstein	Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	pants decomposition, sum of cluster sizes, approximation algorithm, Hierarchical clustering, minimum spanning tree, hyperbolic geometry
18	Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo	Extended formulations for the cardinality constrained subtree of a tree problem.	Oper. Res. Lett.	2009	DBLP DOI BibTeX RDF
18	Yufeng Wu	A practical method for exact computation of subtree prune and regraft distance.	Bioinform.	2009	DBLP DOI BibTeX RDF
18	Peter J. Humphries, Charles Semple	Note on the hybridization number and subtree distance in phylogenetics.	Appl. Math. Lett.	2009	DBLP DOI BibTeX RDF
18	Mike A. Steel, László A. Székely	An improved bound on the maximum agreement subtree problem.	Appl. Math. Lett.	2009	DBLP DOI BibTeX RDF
18	Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul	On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
18	Tomás Flouri, Borivoj Melichar, Jan Janousek	Subtree matching by deterministic pushdown automata.	IMCSIT	2009	DBLP DOI BibTeX RDF
18	Nuo Wei, Qiang Guo, Jia-liang Lv, Yuan-Yuan Yang	A Spanning Subtree Based Multi-channel Time Synchronization Algorithm for Sensor Networks.	ICESS	2009	DBLP DOI BibTeX RDF
18	Jan Janousek	String Suffix Automata and Subtree Pushdown Automata.	Stringology	2009	DBLP BibTeX RDF
18	Maxim Khalilov, José A. R. Fonollosa, Mark Dras	A New Subtree-Transfer Approach to Syntax-Based Reordering for Statistical Machine Translation.	EAMT	2009	DBLP BibTeX RDF
18	Danny Hermelin, Dror Rawitz	Optimization Problems in Multiple Subtree Graphs.	WAOA	2009	DBLP DOI BibTeX RDF
18	Nguyen Bach, Qin Gao, Stephan Vogel	Source-side Dependency Tree Reordering Models with Subtree Movements and Constraints.	MTSummit	2009	DBLP BibTeX RDF
18	Nino Shervashidze, Karsten M. Borgwardt	Fast subtree kernels on graphs.	NIPS	2009	DBLP BibTeX RDF
18	Scott Martens	Quantitative analysis of treebanks using frequent subtree mining methods.	Graph-based Methods for Natural Language Processing	2009	DBLP BibTeX RDF
18	Teresa M. Przytycka	Maximum Agreement Subtree (of 3 or More Trees).	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
18	Ramesh Hariharan	Maximum Agreement Subtree (of 2 Binary Trees).	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
18	Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu	Improved approximation of the largest common subtree of two unordered trees of bounded height.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
18	Hsin-Hao Su, Chin Lung Lu, Chuan Yi Tang	An improved algorithm for finding a length-constrained maximum-density subtree in a tree.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
18	Michael Fuchs 0001	Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations.	Comb. Probab. Comput.	2008	DBLP DOI BibTeX RDF
18	Masanobu Tsuruta, Hiroyuki Sakai 0003, Shigeru Masuyama	An Informative DOM Subtree Identification Method from Web Pages in Unfamiliar Web Sites.	IEICE Trans. Inf. Syst.	2008	DBLP DOI BibTeX RDF
18	Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer	Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees.	SIAM J. Discret. Math.	2008	DBLP DOI BibTeX RDF
18	Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson	Approximate labelled subtree homeomorphism.	J. Discrete Algorithms	2008	DBLP DOI BibTeX RDF
18	Magnus Bordewich, Catherine McCartin, Charles Semple	A 3-approximation algorithm for the subtree distance between phylogenies.	J. Discrete Algorithms	2008	DBLP DOI BibTeX RDF