Search Results - "Neven, F."

Refine Results
  1. 1

    Query automata over finite trees by Neven, Frank, Schwentick, Thomas

    Published in Theoretical computer science (28-03-2002)
    “…A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map…”
    Get full text
    Journal Article
  2. 2

    Primary bile reflux gastritis versus Helicobacter pylori gastritis: a comparative study by Barakat, Enaase A. M. E., Abbas, Neven F., El-Kholi, Nashwa Y.

    Published in The Egyptian journal of internal medicine (01-01-2018)
    “…Background Bile reflux gastritis (BRG) is a common disorder, with few data on its pathophysiology and clinical course, whereas Helicobacter pylori is the…”
    Get full text
    Journal Article
  3. 3

    SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks by Boyen, P., Van Dyck, D., Neven, F., van Ham, R. C. H. J., van Dijk, A. D. J.

    “…Correlated motif mining (cmm) is the problem of finding overrepresented pairs of patterns, called motifs, in sequences of interacting proteins. Algorithmic…”
    Get full text
    Journal Article
  4. 4
  5. 5

    Logical definability and query languages over unranked trees by Libkin, L., Neven, F.

    “…Unranked trees, that is, trees with no restriction on the number of children of nodes, have recently attracted much attention, primarily as an abstraction of…”
    Get full text
    Conference Proceeding
  6. 6

    Typechecking XML views of relational databases by Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.

    “…Motivated by the need to export relational databases as XML data in the context of the World Wide Web, we investigate the type-checking problem for…”
    Get full text
    Conference Proceeding
  7. 7

    Attribute grammars for unranked trees as a query language for structured documents by Neven, Frank

    Published in Journal of computer and system sciences (01-03-2005)
    “…Document specification languages, like for instance XML, model documents using extended context-free grammars. These differ from standard context-free grammars…”
    Get full text
    Journal Article
  8. 8
  9. 9

    On the complexity of typechecking top-down XML transformations by Martens, Wim, Neven, Frank

    Published in Theoretical computer science (01-05-2005)
    “…We investigate the typechecking problem for XML transformations: statically verifying that every answer to a transformation conforms to a given output schema,…”
    Get full text
    Journal Article Conference Proceeding
  10. 10

    Interactome-wide prediction of protein-protein binding sites reveals effects of protein sequence variation in Arabidopsis thaliana by Leal Valentim, Felipe, Neven, Frank, Boyen, Peter, van Dijk, Aalt D J

    Published in PloS one (15-10-2012)
    “…The specificity of protein-protein interactions is encoded in those parts of the sequence that compose the binding interface. Therefore, understanding how…”
    Get full text
    Journal Article
  11. 11

    A formal model for an expressive fragment of XSLT by Bex, Geert Jan, Maneth, Sebastian, Neven, Frank

    Published in Information systems (Oxford) (01-03-2002)
    “…The extension of the eXtensible Style sheet Language (XSL) by variables and passing of data values between template rules has generated a powerful XML query…”
    Get full text
    Journal Article
  12. 12

    Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network by Boyen, Peter, Neven, Frank, van Dyck, Dries, Valentim, Felipe L., van Dijk, Aalt D. J.

    “…Correlated motif covering (CMC) is the problem of finding a set of motif pairs, i.e., pairs of patterns, in the sequences of proteins from a protein-protein…”
    Get full text
    Journal Article
  13. 13

    XML with data values: typechecking revisited by Alon, Noga, Milo, Tova, Neven, Frank, Suciu, Dan, Vianu, Victor

    Published in Journal of computer and system sciences (01-06-2003)
    “…We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output DTD, for inputs…”
    Get full text
    Journal Article
  14. 14

    On the power of tree-walking automata by Neven, Frank, Schwentick, Thomas

    Published in Information and computation (25-05-2003)
    “…Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. To achieve a better understanding of their…”
    Get full text
    Journal Article Conference Proceeding
  15. 15
  16. 16

    Canada by Stras, Marcela B, Stipanovic, Neven F, Boscariol, John W, Silva, Orlando E, Katz, Mark, Fairley, Scott

    Published in The International lawyer (01-07-2008)
    “…The two cases, which are likely to be consolidated into a single proceeding, come on the heels of a WTO panel and Appellate Body decision that concluded that…”
    Get full text
    Journal Article
  17. 17
  18. 18
  19. 19
  20. 20