Ming Li

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Computing Exact p-Value for Structured Motif.

[BibT_eX]

[DOI]

Jing Zhang

Xi Chen

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Information Distance from a Question to an Answer.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Optimizing Multiple Spaced Seeds for Homology Search.

[BibT_eX]

[DOI]

J. Comput. Biol., 2006

Prima: Peptide Robust Identification from Ms/ms Spectra.

[BibT_eX]

[DOI]

Jian Liu

J. Bioinform. Comput. Biol., 2006

A hybrid method for relation extraction from biomedical literature.

[BibT_eX]

[DOI]

Minlie Huang

Xiaoyan Zhu

Int. J. Medical Informatics, 2006

On the Complexity of the Crossing Contact Map Pattern Matching Problem.

[BibT_eX]

[DOI]

Shuai Cheng Li

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Superiority and complexity of the spaced seeds.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

From Three Ideas in TCS to Three Applications in Bioinformatics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Information distance.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

ONBRIRES: Ontology-Based Biological Relation Extraction System.

[BibT_eX]

[DOI]

Proceedings of 4th Asia-Pacific Bioinformatics Conference. 13-16 February 2006, 2006

2005

Finding Cancer Biomarkers from Mass Spectrometry Data by Decision Lists.

[BibT_eX]

[DOI]

Jian Liu

J. Comput. Biol., 2005

tPatternHunter: gapped, fast and sensitive translated homology search .

[BibT_eX]

[DOI]

Bioinform., 2005

Discovering patterns to extract protein-protein interactions from the literature: Part II.

[BibT_eX]

[DOI]

Bioinform., 2005

Discovering Sequence-Structure Motifs from Protein Segments and Two Applications.

[BibT_eX]

[DOI]

Thomas Tang

Jinbo Xu

Proceedings of the Biocomputing 2005, 2005

ExonHunter: a comprehensive approach to gene finding.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

A New Algorithm for Pattern Optimization in Protein-Protein Interaction Extraction System.

[BibT_eX]

[DOI]

Yu Hao

Xiaoyan Zhu

Proceedings of the Pattern Recognition and Image Analysis, Second Iberian Conference, 2005

Consensus fold recognition by predicted model quality.

[BibT_eX]

[DOI]

Jinbo Xu

Libo Yu

Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

PRIME: Peptide robust identification from MS/MS spectra.

[BibT_eX]

[DOI]

Jian Liu

Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004

The similarity metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Shared information and program plagiarism detection.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

A Note on the Single Genotype Resolution Problem.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2004

Protein Threading by Linear Programming: Theoretical Analysis and Computational Results.

[BibT_eX]

[DOI]

Jinbo Xu

Ying Xu

J. Comb. Optim., 2004

Patternhunter Ii: Highly Sensitive and Fast Homology Search.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2004

A Tutorial of Recent Developments in the Seeding of Local Alignment.

[BibT_eX]

[DOI]

Daniel G. Brown

J. Bioinform. Comput. Biol., 2004

Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme.

[BibT_eX]

[DOI]

J. Algorithms, 2004

On spaced seeds for similarity search.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Discovering patterns to extract protein-protein interactions from full texts.

[BibT_eX]

[DOI]

Bioinform., 2004

Discovering Patterns to Extract Protein-Protein Interactions from Full Biomedical Texts.

[BibT_eX]

[DOI]

Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications, 2004

PathwayFinder: Paving the Way Towards Automatic Pathway Extraction.

[BibT_eX]

[DOI]

Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004

2003

Raptor: Optimal Protein Threading by Linear Programming.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2003

Sharpening Occam's razor.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Distinguishing string selection problems.

[BibT_eX]

[DOI]

Inf. Comput., 2003

MOLVIE: an interactive visualization environment for molecular structures.

[BibT_eX]

[DOI]

Huandong Sun

Ying Xu

Comput. Methods Programs Biomed., 2003

Protein Threading by Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

2002

The average-case area of Heilbronn-type triangles.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Finding Similar Regions in Many Sequences.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

On the closest string and substring problems.

[BibT_eX]

[DOI]

J. ACM, 2002

PatternHunter: faster and more sensitive homology search.

[BibT_eX]

[DOI]

Bioinform., 2002

DNACompress: fast and effective DNA sequence compression.

[BibT_eX]

[DOI]

Bioinform., 2002

2001

Selected papers from ALT 1997 - Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

An information-based sequence distance and its application to whole mitochondrial genome phylogeny.

[BibT_eX]

[DOI]

Bioinform., 2001

2000

Minimum description length induction, Bayesianism, and Kolmogorov complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

New applications of the incompressibility method: Part II.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

From Gene Trees to Species Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application.

[BibT_eX]

[DOI]

Paul E. Kearney

SIAM J. Comput., 2000

Average-Case Analysis of Algorithms Using Kolmogorov Complexity.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2000

A lower bound on the average-case complexity of shellsort.

[BibT_eX]

[DOI]

J. ACM, 2000

Fixed topology alignment with recombination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

Applying MDL to Learning Best Model Granularity

[BibT_eX]

[DOI]

Qiong Gao

CoRR, 2000

Applying MDL to learn best model granularity.

[BibT_eX]

[DOI]

Qiong Gao

Artif. Intell., 2000

The Incompressibility Method.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Estimating DNA sequence entropy.

[BibT_eX]

[DOI]

J. Kevin Lanctôt

En-Hui Yang

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Computing the quartet distance between evolutionary trees.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A compression algorithm for DNA sequences and its applications in genome comparison.

[BibT_eX]

[DOI]

Xin Chen

Sam Kwong

Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

1999

Some open problems in computational molecular biology.

[BibT_eX]

[DOI]

Paul E. Kearney

SIGACT News, 1999

Kolmogorov Random Graphs and the Incompressibility Method.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Approximation Algorithms for Directed Steiner Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Average-Case Complexity of Shellsort (Preliminary version)

[BibT_eX]

[DOI]

CoRR, 1999

New Applications of the Incompressibility Method.

[BibT_eX]

[DOI]

Comput. J., 1999

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.

[BibT_eX]

[DOI]

Algorithmica, 1999

Finding Similar Regions in Many Strings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Recovering Branches on the Tree of Life: An Approximation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Average-Case Complexity of Shellsort.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

New Applications of the Incompressibility Method.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

Quartet Cleaning: Improved Algorithms and Simulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

On computing the nearest neighbor interchange distance.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

The Expected Size of Heilbronn's Triangles.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

Some Examples of Average-case Analysis by the Imcompressibility Method.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

Formal Grammars and Languages.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Computability.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Basic Notions in Computational Complexity.

[BibT_eX]

[DOI]

Bala Ravikumar

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Information Distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Addition in log2n + O(1) Steps on Average: A Simple Analysis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

On the Complexity and Approximation of Syntenic Distance.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

New Applications of the Incompressibility Method: Part I

[BibT_eX]

[DOI]

CoRR, 1998

On reconstructing species trees from gene trees in term of duplications and losses.

[BibT_eX]

[DOI]

Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

Orchestrating Quartets: Approximation and Data Correction.

[BibT_eX]

[DOI]

Paul E. Kearney

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Better Approximation of Diagonal-Flip Transformation and Rotation Transformation.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

Average-Case Analysis Using Kolgomorov Complexity (Abstract).

[BibT_eX]

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

Inferring a DNA Sequence from Erroneous Copies.

[BibT_eX]

[DOI]

John D. Kececioglu

Theor. Comput. Sci., 1997

Foreword (COCOON'95).

[BibT_eX]

[DOI]

Ding-Zhu Du

Theor. Comput. Sci., 1997

Reversibility and Adiabatic Computation: Trading Time and Space for Energy

[BibT_eX]

[DOI]

CoRR, 1997

Reversible Simulation of Irreversible Computation by Pebble Games

[BibT_eX]

[DOI]

CoRR, 1997

On Distances between Phylogenetic Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Kolmogorov random graphs.

[BibT_eX]

[DOI]

Harry Buhrman

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Average-Case Analysis via Incompressibility.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

On Prediction by Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning: ECML-97, 1997

Average-Case Analysis Using Kolmogorov Complexity.

[BibT_eX]

Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

Shortest common superstrings.

[BibT_eX]

Proceedings of the Pattern Matching Algorithms, 1997

An introduction to Kolmogorov complexity and its applications, Second Edition.

[BibT_eX]

[DOI]

Graduate Texts in Computer Science, Springer, ISBN: 978-1-4757-2606-0, 1997

Formal Models and Computability.

[BibT_eX]

Bala Ravikumar

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Iterative Belief Revision in Extended Logic Programming.

[BibT_eX]

[DOI]

Jia-Huai You

Robert Cartwright

Theor. Comput. Sci., 1996

DNA Sequencing and String Learning.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1996

K One-Way Heads Cannot Do String-Matching.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

How to Share Concurrent Wait-Free Variables.

[BibT_eX]

[DOI]

J. ACM, 1996

Lower Bounds on Learning Decision Lists and Trees.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Some Notes on the Nearest Neighbour Interchange Distance.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

Reversible Simulation of Irreversible Computation.

[BibT_eX]

[DOI]

Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995

A New Approach to Formal Language Theory by Kolmogorov Complexity.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Algorithmic Arguments in Physics of Computation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Inferring a DNA Sequence from Erroneous Copies (Abstract).

[BibT_eX]

[DOI]

John D. Kececioglu

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

Computational Machine Learning in Theory and Praxis.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

Approximating Shortest Superstrings with Constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Wait-Free Consensus Using Asynchronous Hardware.

[BibT_eX]

[DOI]

Benny Chor

SIAM J. Comput., 1994

Statistical Properties of Finite Sequences with High Kolmogorov Complexity.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1994

Kolmogorov Complexity Arguments in Combinatorics.

[BibT_eX]

J. Comb. Theory A, 1994

Three One-Way Heads Cannot Do String Matching.

[BibT_eX]

[DOI]

Mihály Geréb-Graus

J. Comput. Syst. Sci., 1994

Learning Boolean Formulas.

[BibT_eX]

[DOI]

Michael J. Kearns

Leslie G. Valiant

J. ACM, 1994

Linear Approximation of Shortest Superstrings.

[BibT_eX]

[DOI]

J. ACM, 1994

1993

On the Complexity of Learning Strings and Sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Learning in the Presence of Malicious Errors.

[BibT_eX]

[DOI]

Michael J. Kearns

SIAM J. Comput., 1993

Bonded Time-Stamps.

[BibT_eX]

[DOI]

Distributed Comput., 1993

Approximating Shortest Superstrings with Constraints (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Thermodynamics of computation and information distance.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

An introduction to Kolmogorov complexity and its applications.

[BibT_eX]

[DOI]

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4757-3860-5, 1993

1992

The Power of the Queue.

[BibT_eX]

[DOI]

Luc Longpré

SIAM J. Comput., 1992

Inductive Reasoning and Kolmogorov Complexity.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1992

Optimality of Wait-Free Atomic Multiwriter Variables.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

A Note on Shortest Superstrings with Flipping.

[BibT_eX]

[DOI]

Ding-Zhu Du

Inf. Process. Lett., 1992

Theory and Algorithms for Plan Merging.

[BibT_eX]

[DOI]

David E. Foulser

Qiang Yang

Artif. Intell., 1992

Philosophical Issues in Kolmogorov Complexity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Inductive reasoning.

[BibT_eX]

[DOI]

Proceedings of the Language Computations, 1992

1991

Learning Simple Concept Under Simple Distributions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Resource Bounds for Parallel Computation of Threshold and Symmetric Functions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1991

Combinatorics and Kolmogorov Complexity.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

A Quantitative Theory for Plan Merging.

[BibT_eX]

[DOI]

David E. Foulser

Qiang Yang

Proceedings of the 9th National Conference on Artificial Intelligence, 1991

An introduction to Kolmogorov - complexity and its applications ; part 1: theory.

[BibT_eX]

CWI, 1991

1990

Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Kolmogorov Complexity and its Applications.

[BibT_eX]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

On the Power of Concurrent-Write PRAMs With Read-Only Memory

[BibT_eX]

[DOI]

Inf. Comput., November, 1989

New lower bounds for parallel computation.

[BibT_eX]

[DOI]

J. ACM, 1989

Geometric Optimization and Dp - Completeness.

[BibT_eX]

[DOI]

Chandrajit L. Bajaj

Discret. Comput. Geom., 1989

The Minimum Description Length Principle and Its Application to Online Learning of Handprinted Characters.

[BibT_eX]

[DOI]

Qiong Gao

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Inductive Reasoning and Komogorov Complexity.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988

Tape versus Queue and Stacks: The Lower Bounds

[BibT_eX]

[DOI]

Inf. Comput., July, 1988

Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

k+1 Heads Are Better than k for PDAs.

[BibT_eX]

[DOI]

Marek Chrobak

J. Comput. Syst. Sci., 1988

A Separator Theorem for One-Dimensional Graphs Under Linear Mapping.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Learning in the Presence of Malicious Errors (Extended Abstract)

[BibT_eX]

[DOI]

Michael J. Kearns

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

On the Learnability of Finite Automata.

[BibT_eX]

[DOI]

Umesh V. Vazirani

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation

[BibT_eX]

[DOI]

Inf. Comput., May, 1987

On the Learnability of Boolean Formulae

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

On Processor Coordination Using Asynchronous Hardware.

[BibT_eX]

[DOI]

Benny Chor

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Bounded Time-Stamps (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Containment, Separation, Complete Sets, and Immunity of Complexity Classes.

[BibT_eX]

[DOI]

Juris Hartmanis

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

k+1 Heads Are Better than k for PDA's

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Lower Bounds in Computational Complexity.

[BibT_eX]

PhD thesis, 1985

Lower Bounds by Kolmogorov-Complexity (Extended Abstract).

[BibT_eX]

[DOI]