Falk Hüffner

Dr. Falk Hüffner


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2006 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
JGJiong Guo
Jiong Guo
JGJens Gramm
Jens Gramm
FHFalk Hüffner
Falk Hüffner
RNRolf Niedermeier
Rolf Niedermeier
SWSebastian Wernicke
Sebastian Wernicke

28 January 2005 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
JGJens Gramm
Jens Gramm
JGJiong Guo
Jiong Guo
FHFalk Hüffner
Falk Hüffner
RNRolf Niedermeier
Rolf Niedermeier

15 October 2008 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
FHFalk Hüffner
Falk Hüffner
CKChristian Komusiewicz
Christian Komusiewicz
HMHannes Moser
Hannes Moser
RNRolf Niedermeier
Rolf Niedermeier

19 March 2004 in Algorithmica
Verified
Journal Article
Closed access
PDF file
JGJens Gramm
Jens Gramm
JGJiong Guo
Jiong Guo
FHFalk Hüffner
Falk Hüffner
RNRolf Niedermeier
Rolf Niedermeier

1 March 2010 in Journal of Discrete Algorithms
Verified
Journal Article
Closed access
MDMichael Dom
Michael Dom
JGJiong Guo
Jiong Guo
FHFalk Hüffner
Falk Hüffner
RNRolf Niedermeier
Rolf Niedermeier
ATAnke Truss
Anke Truss

1 March 2010 in Journal of Computational Biology
Verified
Journal Article
Closed access
SBSharon Bruckner
Sharon Bruckner
FHFalk Hüffner
Falk Hüffner
RKRichard M. Karp
Richard M. Karp
RSRon Shamir
Ron Shamir
RSRoded Sharan
Roded Sharan
In the network querying problem, one is given a protein complex or pathway of species A and a protein–protein interaction network of species B; the goal is to identify subnetworks of B that are similar to the query in terms of sequence, topology, or both. Existing approaches mostly depend on knowledge of the interaction topology of the query in the network of species A; however, in practice, this topology is often not known. To address this problem, we develop a topology-free querying algorithm, which we call Torque. Given a query, represented as a set of proteins, Torque seeks a matching set of proteins that are sequence-similar to the query proteins and span a connected region of the network, while allowing both insertions and deletions. The algorithm uses alternatively dynamic programming and integer linear programming for the search task. We test Torque with queries from yeast, fly, and human, where we compare it to the QNet topology-based approach, and with queries from less studied species, where only topology-free algorithms apply. Torque detects many more matches than QNet, while giving results that are highly functionally coherent.