Partial information network queries

Ron Y. Pinter; Meirav Zehavi

doi:10.1007/978-3-642-45278-9_31

Partial information network queries

Ron Y. Pinter, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

We present a new pattern matching problem, the partial information query (PIQ) problem, which includes as special cases two problems that have important applications in bioinformatics: the alignment query (AQ) problem and the topology-free query (TFQ) problem. In both problems we have a pattern P and a graph H, and we seek a subgraph of H that resembles P. AQ requires knowing the topology of P, while TFQ ignores it. PIQ fits the scenario where partial information is available on the topology of P. Our main result is a parameterized algorithm for PIQ, which can handle inputs where P is a set of trees. It significantly improves the best known running time in solving TFQ. We also improve the best known running times in solving two special cases of AQ.

Original language	English
Title of host publication	Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Revised Selected Papers
Pages	362-375
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-642-45278-9_31
State	Published - 1 Dec 2013
Externally published	Yes
Event	24th International Workshop on Combinatorial Algorithms, IWOCA 2013 - Rouen, France Duration: 10 Jul 2013 → 12 Jul 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8288 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	24th International Workshop on Combinatorial Algorithms, IWOCA 2013
Country/Territory	France
City	Rouen
Period	10/07/13 → 12/07/13

Keywords

alignment query
parameterized algorithm
partial information query
pattern matching
topology-free query

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-45278-9_31

Cite this

Pinter, R. Y., & Zehavi, M. (2013). Partial information network queries. In Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Revised Selected Papers (pp. 362-375). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8288 LNCS). https://doi.org/10.1007/978-3-642-45278-9_31

@inproceedings{f942a03334a2463fb2afb61b538fabd7,

title = "Partial information network queries",

abstract = "We present a new pattern matching problem, the partial information query (PIQ) problem, which includes as special cases two problems that have important applications in bioinformatics: the alignment query (AQ) problem and the topology-free query (TFQ) problem. In both problems we have a pattern P and a graph H, and we seek a subgraph of H that resembles P. AQ requires knowing the topology of P, while TFQ ignores it. PIQ fits the scenario where partial information is available on the topology of P. Our main result is a parameterized algorithm for PIQ, which can handle inputs where P is a set of trees. It significantly improves the best known running time in solving TFQ. We also improve the best known running times in solving two special cases of AQ.",

keywords = "alignment query, parameterized algorithm, partial information query, pattern matching, topology-free query",

author = "Pinter, {Ron Y.} and Meirav Zehavi",

year = "2013",

month = dec,

day = "1",

doi = "10.1007/978-3-642-45278-9_31",

language = "English",

isbn = "9783642452772",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "362--375",

booktitle = "Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Revised Selected Papers",

note = "24th International Workshop on Combinatorial Algorithms, IWOCA 2013 ; Conference date: 10-07-2013 Through 12-07-2013",

}

Pinter, RY & Zehavi, M 2013, Partial information network queries. in Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8288 LNCS, pp. 362-375, 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, Rouen, France, 10/07/13. https://doi.org/10.1007/978-3-642-45278-9_31

Partial information network queries. / Pinter, Ron Y.; Zehavi, Meirav.
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Revised Selected Papers. 2013. p. 362-375 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8288 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Partial information network queries

AU - Pinter, Ron Y.

AU - Zehavi, Meirav

PY - 2013/12/1

Y1 - 2013/12/1

N2 - We present a new pattern matching problem, the partial information query (PIQ) problem, which includes as special cases two problems that have important applications in bioinformatics: the alignment query (AQ) problem and the topology-free query (TFQ) problem. In both problems we have a pattern P and a graph H, and we seek a subgraph of H that resembles P. AQ requires knowing the topology of P, while TFQ ignores it. PIQ fits the scenario where partial information is available on the topology of P. Our main result is a parameterized algorithm for PIQ, which can handle inputs where P is a set of trees. It significantly improves the best known running time in solving TFQ. We also improve the best known running times in solving two special cases of AQ.

AB - We present a new pattern matching problem, the partial information query (PIQ) problem, which includes as special cases two problems that have important applications in bioinformatics: the alignment query (AQ) problem and the topology-free query (TFQ) problem. In both problems we have a pattern P and a graph H, and we seek a subgraph of H that resembles P. AQ requires knowing the topology of P, while TFQ ignores it. PIQ fits the scenario where partial information is available on the topology of P. Our main result is a parameterized algorithm for PIQ, which can handle inputs where P is a set of trees. It significantly improves the best known running time in solving TFQ. We also improve the best known running times in solving two special cases of AQ.

KW - alignment query

KW - parameterized algorithm

KW - partial information query

KW - pattern matching

KW - topology-free query

UR - http://www.scopus.com/inward/record.url?scp=84893107325&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-45278-9_31

DO - 10.1007/978-3-642-45278-9_31

M3 - Conference contribution

AN - SCOPUS:84893107325

SN - 9783642452772

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 362

EP - 375

BT - Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Revised Selected Papers

T2 - 24th International Workshop on Combinatorial Algorithms, IWOCA 2013

Y2 - 10 July 2013 through 12 July 2013

ER -

Partial information network queries

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this