Jason T. L. Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jason T. L. Wang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Kaizhong Zhang
Department of Computer Science, University of Western Ontario, London, Canada
2 shared publications Bruce A. Shapiro
1 shared publication- Chia-Yo Chang
Department of Computer and Information Science, New Jersey Institute of Technology, University Heights, Newark, NJ 07102, USA
1 shared publication Dennis Shasha
1 shared publication- Dennis Shasha
Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA
1 shared publication James R Gattiker
1 shared publication
Latest Publications
- 9 November 2001
- Published by Elsevier in Information Sciences
- Vol. 139 (1-2) , 1-2
Bioinformatics
- 2 December 1999
- Published by Elsevier in Information Sciences
- Vol. 121 (3-4) , 367-386
Identifying approximately common substructures in trees based on a restricted edit distance
- 2 December 1999
- Published by Elsevier in Information Sciences
- Vol. 121 (3-4) , 367-386
Identifying approximately common substructures in trees based on a restricted edit distance
- 1 January 1999
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 6 (2) , 209-218
New Techniques for DNA Sequence Classification
DNA sequence classification is the activity of determining whether or not an unlabeled sequence S belongs to an existing class C. This paper proposes two new techniques for DNA sequence classification. The first technique works by comparing the unlabeled sequence S with a group of active motifs discovered from the elements of C and by distinction with elements outside of C. The second technique generates and matches gapped fingerprints of S with elements of C. Experimental results obtained by running these algorithms on long and well conserved Alu sequences demonstrate the good performance of the presented methods compared with FASTA. When applied to less conserved and relatively short functional sites such as splice-junctions, a variation of the second technique combining fingerprinting with consensus sequence analysis gives better results than the current classifiers employing text compression and machine learning algorithms.
- 1 January 1999
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 6 (2) , 209-218
New Techniques for DNA Sequence Classification
DNA sequence classification is the activity of determining whether or not an unlabeled sequence S belongs to an existing class C. This paper proposes two new techniques for DNA sequence classification. The first technique works by comparing the unlabeled sequence S with a group of active motifs discovered from the elements of C and by distinction with elements outside of C. The second technique generates and matches gapped fingerprints of S with elements of C. Experimental results obtained by running these algorithms on long and well conserved Alu sequences demonstrate the good performance of the presented methods compared with FASTA. When applied to less conserved and relatively short functional sites such as splice-junctions, a variation of the second technique combining fingerprinting with consensus sequence analysis gives better results than the current classifiers employing text compression and machine learning algorithms.
- 1 January 1998
- Published by Springer Nature
- p. 104-117
An approximate oracle for distance in metric spaces
- 1 January 1998
- Published by Springer Nature
- p. 104-117
An approximate oracle for distance in metric spaces