Search results for "Subtree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Sylvain Guillemot, François Nicolas	Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees	CoRR	2008	DBLP BibTeX RDF
18		On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems	CoRR	2008	DBLP BibTeX RDF
18	Justo Puerto, Arie Tamir, Juan A. Mesa, Dionisio Pérez-Brito	Center location problems on tree graphs with subtree-shaped customers.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
18	Jan van den Heuvel, Matthew Johnson 0002	Transversals of subtree hypergraphs and the source location problem in digraphs.	Networks	2008	DBLP DOI BibTeX RDF
18	Michael O'Neill 0001, Anthony Brabazon, Erik Hemberg	Subtree deactivation control with grammatical Genetic Programming in dynamic environments.	IEEE Congress on Evolutionary Computation	2008	DBLP DOI BibTeX RDF
18	Huayang Xie, Mengjie Zhang 0001, Peter Andreae	An analysis of the distribution of swapped subtree sizes in tree-based genetic programming.	IEEE Congress on Evolutionary Computation	2008	DBLP DOI BibTeX RDF
18	Sun-Yuan Hsieh, Chao-Wen Huang	An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation.	Appl. Math. Comput.	2007	DBLP DOI BibTeX RDF
18	Artem Chebotko, Mustafa Atay, Shiyong Lu, Farshad Fotouhi	XML subtree reconstruction from relational storage of XML documents.	Data Knowl. Eng.	2007	DBLP DOI BibTeX RDF
18	Gregory L. Cherlin, Saharon Shelah	Universal graphs with a forbidden subtree.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
18	David Eppstein	Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition.	SODA	2007	DBLP BibTeX RDF
18	Dat P. T. Nguyen, Yutaka Matsuo, Mitsuru Ishizuka	Subtree Mining for Relation Extraction from Wikipedia.	HLT-NAACL (Short Papers)	2007	DBLP BibTeX RDF
18	Gongye Zhou, Qiuju Lan, Jincai Chen	A Dynamic Metadata Equipotent Subtree Partition Policy for Mass Storage System.	FCST	2007	DBLP DOI BibTeX RDF
18	Dat P. T. Nguyen, Yutaka Matsuo, Mitsuru Ishizuka	Relation Extraction from Wikipedia Using Subtree Mining.	AAAI	2007	DBLP BibTeX RDF
18	José L. Balcázar, Albert Bifet, Antoni Lozano	Subtree Testing and Closed Tree Mining Through Natural Representations.	DEXA Workshops	2007	DBLP DOI BibTeX RDF
18	Minh Le Nguyen 0001, Nguyen Thanh Tri, Akira Shimazu	Subtree Mining for Question Classification Problem.	IJCAI	2007	DBLP BibTeX RDF
18	Wenxin Liang, Xiangyong Ouyang, Haruo Yokota	An XML subtree segmentation method based on syntactic segmentation rate.	ICDIM	2007	DBLP DOI BibTeX RDF
18	Zeshan Peng, Hing-Fung Ting	An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees.	Inf. Process. Lett.	2006	DBLP DOI BibTeX RDF
18	David Eppstein	Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition	CoRR	2006	DBLP BibTeX RDF
18	Hiroshi Nagamochi, Taizo Kawada	Minmax subtree cover problem on cacti.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
18	J. Mark Keil, Lorna Stewart	Approximating the minimum clique cover and other hard problems in subtree filament graphs.	Discret. Appl. Math.	2006	DBLP DOI BibTeX RDF
18	Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen	Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics.	Discret. Optim.	2006	DBLP DOI BibTeX RDF
18	David Eisenstat, Gary Gordon	Non-isomorphic caterpillars with identical subtree data.	Discret. Math.	2006	DBLP DOI BibTeX RDF
18	Maria Luisa Bonet, Katherine St. John, Ruchi Mahindru, Nina Amenta	Approximating Subtree Distances Between Phylogenies.	J. Comput. Biol.	2006	DBLP DOI BibTeX RDF
18	Yun Chi, Richard R. Muntz, Siegfried Nijssen, Joost N. Kok	Frequent Subtree Mining - An Overview.	Fundam. Informaticae	2005	DBLP BibTeX RDF
18	Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang	An improved algorithm for the maximum agreement subtree problem.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
18	Ryo Nojima, Yuichi Kaji	Secure, Efficient and Practical Key Management Scheme in the Complete-Subtree Method.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2005	DBLP BibTeX RDF
18	Hiroshi Nagamochi	Approximating the Minmax Rooted-Subtree Cover Problem.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2005	DBLP DOI BibTeX RDF
18	Ryo Nojima, Yuichi Kaji	Using Trapdoor Permutations in a Complete Subtree Method for Broadcast Encryption.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2005	DBLP BibTeX RDF
18	Yongqiao Xiao, Jenq-Foung Yao, G. Yang	Discovering Frequent Embedded Subtree Patterns from Large Databases of Unordered Labeled Trees.	Int. J. Data Warehous. Min.	2005	DBLP DOI BibTeX RDF
18	Shane Dye	Subtree decomposition for multistage stochastic programs.	Algorithms for Optimization with Incomplete Information	2005	DBLP BibTeX RDF
18	Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafael Berlanga Llavori	Approximate Subtree Identification in Heterogeneous XML Documents Collections.	XSym	2005	DBLP DOI BibTeX RDF
18	Taku Kudo, Jun Suzuki, Hideki Isozaki	Boosting-based Parse Reranking with Subtree Features.	ACL	2005	DBLP BibTeX RDF
18	Lior Pachter, David E Speyer	Reconstructing trees from subtree weights.	Appl. Math. Lett.	2004	DBLP DOI BibTeX RDF
18	Wing-Kai Hon, Tak Wah Lam, Siu-Ming Yiu, Ming-Yang Kao, Wing-Kin Sung	Subtree Transfer Distance For Degree-D Phylogenies.	Int. J. Found. Comput. Sci.	2004	DBLP DOI BibTeX RDF
18	Alois Panholzer	The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees.	Random Struct. Algorithms	2004	DBLP DOI BibTeX RDF
18	Christina Fragouli, Emina Soljanin	Subtree decomposition for network coding.	ISIT	2004	DBLP DOI BibTeX RDF
18	Riccardo Poli, Nicholas Freitag McPhee	General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part I.	Evol. Comput.	2003	DBLP DOI BibTeX RDF
18	Riccardo Poli, Nicholas Freitag McPhee	General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II.	Evol. Comput.	2003	DBLP DOI BibTeX RDF
18	Mark E. Roberts	The Effectiveness of Cost Based Subtree Caching Mechanisms in Typed Genetic Programming for Image Segmentation.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
18	Kilian A. Foth, Wolfgang Menzel	Subtree Parsing to Speed up Deep Analysis.	IWPT	2003	DBLP BibTeX RDF
18	Boris Chidlovskii	Information Extraction from Tree Documents by Learning Subtree Delimiters.	IIWeb	2003	DBLP BibTeX RDF
18	Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu	Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers	CoRR	2002	DBLP BibTeX RDF
18	Arie Tamir, Justo Puerto, Dionisio Pérez-Brito	The centdian subtree on tree networks.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
18	Riccardo Poli, Nicholas Freitag McPhee	Exact GP schema theory for headless chicken crossover and subtree mutation.	CEC	2001	DBLP DOI BibTeX RDF
18	David Bryant, Andy McKenzie, Mike A. Steel	The size of a maximum agreement subtree for random binary trees.	Bioconsensus	2001	DBLP DOI BibTeX RDF
18	Sajal K. Das 0001, Maria Cristina Pinotti	Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates.	J. Parallel Distributed Comput.	2000	DBLP DOI BibTeX RDF
18	Seiji Kataoka, Norio Araki, Takeo Yamada	Upper and lower bounding procedures for minimum rooted k-subtree problem.	Eur. J. Oper. Res.	2000	DBLP DOI BibTeX RDF
18	Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri	Approximating the Maximum Isomorphic Agreement Subtree is Hard.	Int. J. Found. Comput. Sci.	2000	DBLP DOI BibTeX RDF
18	Richard Cole 0001, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup	An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
18	Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam	Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers.	ISAAC	2000	DBLP DOI BibTeX RDF
18	Yefim Dinitz, Alon Itai, Michael Rodeh	On an Algorithm of Zemlyachenko for Subtree Isomorphism.	Inf. Process. Lett.	1999	DBLP DOI BibTeX RDF
18	Juhani Nieminen, Matti Peltola	The subtree center of a tree.	Networks	1999	DBLP DOI BibTeX RDF
18	Ron Shamir, Dekel Tsur	Faster Subtree Isomorphism.	J. Algorithms	1999	DBLP DOI BibTeX RDF
18	Tomasz Radzik	Implementation of Dynamic Trees with In-Subtree Operations.	ACM J. Exp. Algorithmics	1998	DBLP DOI BibTeX RDF
18	Amram Meir, John W. Moon	Addendum to On the log-product of the subtree-sizes of random trees.	Random Struct. Algorithms	1998	DBLP DOI BibTeX RDF
18	Amram Meir, John W. Moon	On the log-product of the subtree-sizes of random trees.	Random Struct. Algorithms	1998	DBLP DOI BibTeX RDF
18	Lai-Man Po, Ying Zhang, Kwok-Wai Cheung 0002, Chun-Ho Cheung	A novel subtree partitioning algorithm for wavelet-based fractal image coding.	ICASSP	1998	DBLP DOI BibTeX RDF
18	Kumar Chellapilla	Evolving computer programs without subtree crossover.	IEEE Trans. Evol. Comput.	1997	DBLP DOI BibTeX RDF
18	Betty L. Hickman, Dan Scott	A Subtree-Partitioning Algorithm for Inducing Parallelism in Network Simplex Dual Updates.	Comput. Optim. Appl.	1997	DBLP DOI BibTeX RDF
18	Geon Cho, Dong X. Shaw, Seong-Lyun Kim	An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks.	Comput. Oper. Res.	1997	DBLP DOI BibTeX RDF
18	Amihood Amir, Dmitry Keselman	Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms.	SIAM J. Comput.	1997	DBLP DOI BibTeX RDF
18	Peter J. Angeline	Comparing Subtree Crossover with Macromutation.	Evolutionary Programming	1997	DBLP DOI BibTeX RDF
18	Raymond Greenlaw	Subtree Isomorphism is in DLOG for Nested Trees.	Int. J. Found. Comput. Sci.	1996	DBLP DOI BibTeX RDF
18	Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting	Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.	Nord. J. Comput.	1996	DBLP BibTeX RDF
18	Richard Cole 0001, Ramesh Hariharan	An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.	SODA	1996	DBLP DOI BibTeX RDF
18	Salvador Roura, Conrado Martínez	Randomization of Search Trees by Subtree Size.	ESA	1996	DBLP DOI BibTeX RDF
18	Teresa M. Przytycka	Sparse dynamic programming for maximum agreement subtree problem.	Mathematical Hierarchies and Biology	1996	DBLP DOI BibTeX RDF
18	Omer Berkman, Costas S. Iliopoulos, Kunsoo Park	The Subtree Max Gap Problem with Application to Parallel String Covering.	Inf. Comput.	1995	DBLP DOI BibTeX RDF
18	Patrizio Cintioli, Sauro Tulipani	Σ11-Completeness of a Fragment of the Theory of Trees With Subtree Relation.	Notre Dame J. Formal Log.	1994	DBLP DOI BibTeX RDF
18	Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park	The Subtree Max Gap Problem with Application to Parallel String Covering.	SODA	1994	DBLP DOI BibTeX RDF
18	Mike A. Steel, Tandy J. Warnow	Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree.	Inf. Process. Lett.	1993	DBLP DOI BibTeX RDF
18	Eric Bibelnieks, Perino M. Dearing	Neighborhood Subtree Tolerance Graphs.	Discret. Appl. Math.	1993	DBLP DOI BibTeX RDF
18	Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West	Subtree and Substar Intersection Numbers.	Discret. Appl. Math.	1993	DBLP DOI BibTeX RDF
18	Tadashi Naruse, Mikio Shinya, Takafumi Saito	Ray tracing using dynamic subtree - algorithm and speed evaluation.	Syst. Comput. Jpn.	1993	DBLP DOI BibTeX RDF
18	Mo Mu, John R. Rice	A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes.	SIAM J. Sci. Comput.	1992	DBLP DOI BibTeX RDF
18	Roberto Grossi	Further Comments on the Subtree Isomorphism for Ordered Trees.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF
18	Roberto Grossi	A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.	Inf. Process. Lett.	1991	DBLP DOI BibTeX RDF
18	Yatin P. Saraiya	Subtree-elimination algorithms in deductive databases.		1991	RDF
18	Pratul Dublish	Some Comments on the Subtree Isomorphism Problem for Ordered Trees.	Inf. Process. Lett.	1990	DBLP DOI BibTeX RDF
18	Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker	Subtree isomorphism is in random NC.	Discret. Appl. Math.	1990	DBLP DOI BibTeX RDF
18	An Feng, Tohru Kikuno, Koji Torii	Incremental Attribute Evaluation for Multiple Subtree Replacements in Structure-Oriented Environments.	WAGA	1990	DBLP DOI BibTeX RDF
18	Andrzej Lingas, Marek Karpinski	Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
18	Erkki Mäkinen	On the Subtree Isomorphism Problem for Ordered Trees.	Inf. Process. Lett.	1989	DBLP DOI BibTeX RDF
18	Robert E. Webber, Michael B. Dillencourt	Compressing quadtrees via common subtree merging.	Pattern Recognit. Lett.	1989	DBLP DOI BibTeX RDF
18	Rakesh M. Verma, Steven W. Reyner	An Analysis of a Good Algorithm for the Subtree Problem, Corrected.	SIAM J. Comput.	1989	DBLP DOI BibTeX RDF
18	Stephen B. Peckham	Incremental Attribute Evaluation and Multiple Subtree Replacements.		1989	RDF
18	Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker	Subtree Isomorphism is in Random NC.	AWOC	1988	DBLP DOI BibTeX RDF
18	Matthew B. Lowrie, W. Kent Fuchs	Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	tree architectures, spare processors, Fault tolerance, reliability, reconfiguration
18	Reiner Creutzburg	Parallel Linear Conflict-Free Subtree Access.	Parallel Algorithms and Architectures	1987	DBLP DOI BibTeX RDF
18	Michael Gössel, R. Rebel	Memories for Parallel Subtree-Access.	Parallel Algorithms and Architectures	1987	DBLP DOI BibTeX RDF
18	Robert E. Jamison	On the average number of nodes in a subtree of a tree.	J. Comb. Theory, Ser. B	1983	DBLP DOI BibTeX RDF
18	Andrzej Lingas	An Application of Maximum Bipartite C-Matching to Subtree Isomorphism.	CAAP	1983	DBLP DOI BibTeX RDF
18	Alberto Pettorossi	A property which guarantees termination in weak combinatory logic and subtree replacement systems.	Notre Dame J. Formal Log.	1981	DBLP DOI BibTeX RDF
18	John Staples	Speeding up Subtree Replacement Systems.	Theor. Comput. Sci.	1980	DBLP DOI BibTeX RDF
18	Alberto Pettorossi	Synthesis of subtree rewriting systems behaviour by solving equations.	CLAAP	1980	DBLP BibTeX RDF
18	Manfred P. Stadel	A remark on the time complexity of the subtree problem.	Computing	1978	DBLP DOI BibTeX RDF
18	Steven W. Reyner	An Analysis of a Good Algorithm for the Subtree Problem.	SIAM J. Comput.	1977	DBLP DOI BibTeX RDF
18	Mike O'Donnell	Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic	STOC	1977	DBLP DOI BibTeX RDF
18	Barry K. Rosen	Subtree replacement systems.		1971	RDF
10	Leonardo Vanneschi	Fitness landscapes and problem hardness in genetic programming.	GECCO (Companion)	2010	DBLP DOI BibTeX RDF	genetic programming, fitness landscapes, problem difficulty