About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Recent

Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

Author: Bille remove
Filter results...

Interpreted as:

title:(Matching AND Subsequences AND in AND Trees)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
Previous 1 - 6 of 6 Next
Export
10 items by relevance
1 Journal article

Matching Subsequences in Trees

Bille, Philip; Gørtz, Inge Li

Journal of Discrete Algorithms — 2009, Volume 7, Issue 3, pp. 306-314

Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new

Year: 2009

Language: English

More...
dig kbhjlcna m poef
2 Conference paper · Book chapter

Matching Subsequences in Trees

Bille, Philip; Gørtz, Inge Li

Proc. 6th Conference on Algorithms and Complexity (ciac 2006) — 2006, pp. 248-259

Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new

Year: 2006

Language: English

More...
nja pblieg omdhkcf
3 Preprint article

Matching Subsequences in Trees

Bille, Philip; Goertz, Inge Li

Given two rooted, labeled trees $P$ and $T$ the tree path subsequence problem is to determine which paths in $P$ are subsequences of which paths in $T$. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new

Year: 2007

Language: Undetermined

More...
elfnamohj bki p gcd
4 Preprint article

Compressed Subsequence Matching and Packed Tree Coloring

Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$ space and $O(n+\frac{n\sigma}{w}+m\log

Year: 2014

Language: Undetermined

More...
agbdl ocije pf hmnk
5 Conference paper

Compressed Subsequence Matching and Packed Tree Coloring

Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

Lecture Notes in Computer Science — 2014, pp. 40-49

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size σ, our algorithm uses \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym

Year: 2014

Language: English

More...
ldan m jphikg coefb
6 Journal article

Compressed Subsequence Matching and Packed Tree Coloring

Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

Algorithmica — 2017, Volume 77, Issue 2, pp. 336-348

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \(\sigma \), our algorithm uses \(O(n+\frac{n\sigma }{w})\) space and \(O(n+\frac{n\sigma }{w}+m\log

Year: 2017

Language: English

More...
ao fjmdlkpncehgib

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user