Demo Data from VLDB 2026 / reviewers in the wild / expert
Matthew I. Bellgard
dblp:64/1324
· DBLP profile ↗
6ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0002-6303-9469ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence alignment
pairwise sequence alignment |
0.1 | 1 | 2005 | Statistical evaluation and comparison of a pairwise alignment algorithm that a priori assigns the number of gaps rather than employing gap penalties · Bioinform. 2005 |
Bioinformatics and computational biology
sequence alignment |
0.1 | 1 | 2005 | Statistical evaluation and comparison of a pairwise alignment algorithm that a priori assigns the number of gaps rather than employing gap penalties · Bioinform. 2005 |
Bioinformatics and computational biology
genome annotation |
0.0 | 1 | 2003 | MASV - Multiple (BLAST) Annotation System Viewer · Bioinform. 2003 |
Bioinformatics and computational biology › bioinformatics infrastructure
bioinformatic tool integration |
0.0 | 1 | 1999 | ORBIT: an integrated environment for user-customized bioinformatics tools · Bioinform. 1999 |
Bioinformatics and computational biology
comparative genomics |
0.0 | 1 | 2005 | Statistical evaluation and comparison of a pairwise alignment algorithm that a priori assigns the number of gaps rather than employing gap penalties · Bioinform. 2005 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 2003 | MASV - Multiple (BLAST) Annotation System Viewer · Bioinform. 2003 |
Methods — techniques the papers use, named apart from their topics
statistical evaluation · 0.1smith-waterman · 0.1needleman-wunsch · 0.1BLAST · 0.0java · 0.0client-server architecture · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | An internet-based bioinformatics toolkit for plant biosecurity diagnosis and surveillance of viruses and viroidsabstractBACKGROUND: Detection and preventing entry of exotic viruses and viroids at the border is critical for protecting plant industries trade worldwide. Existing post entry quarantine screening protocols rely on time-consuming biological indicators and/or molecular assays that require knowledge of infecting viral pathogens. Plants have developed the ability to recognise and respond to viral infections through Dicer-like enzymes that cleave viral sequences into specific small RNA products. Many studies reported the use of a broad range of small RNAs encompassing the product sizes of several Dicer enzymes involved in distinct biological pathways. Here we optimise the assembly of viral sequences by using specific small RNA subsets. RESULTS: We sequenced the small RNA fractions of 21 plants held at quarantine glasshouse facilities in Australia and New Zealand. Benchmarking of several de novo assembler tools yielded SPAdes using a kmer of 19 to produce the best assembly outcomes. We also found that de novo assembly using 21-25 nt small RNAs can result in chimeric assemblies of viral sequences and plant host sequences. Such non-specific assemblies can be resolved by using 21-22 nt or 24 nt small RNAs subsets. Among the 21 selected samples, we identified contigs with sequence similarity to 18 viruses and 3 viroids in 13 samples. Most of the viruses were assembled using only 21-22 nt long virus-derived siRNAs (viRNAs), except for one Citrus endogenous pararetrovirus that was more efficiently assembled using 24 nt long viRNAs. All three viroids found in this study were fully assembled using either 21-22 nt or 24 nt viRNAs. Optimised analysis workflows were customised within the Yabi web-based analytical environment. We present a fully automated viral surveillance and diagnosis web-based bioinformatics toolkit that provides a flexible, user-friendly, robust and scalable interface for the discovery and diagnosis of viral pathogens. CONCLUSIONS: We have implemented an automated viral surveillance and diagnosis (VSD) bioinformatics toolkit that produces improved viruses and viroid sequence assemblies. The VSD toolkit provides several optimised and reusable workflows applicable to distinct viral pathogens. We envisage that this resource will facilitate the surveillance and diagnosis viral pathogens in plants, insects and invertebrates. Roberto A. Barrero, Kathryn R. Napier, James Cunnington, Lia Liefting, Sandi Keenan, Rebekah A. Frampton, Tamás O. Szabó, Simon Bulman, Adam Hunter, Lisa Ward, Mark Whattam, Matthew I. Bellgard |
BMC Bioinform. | 12 |
| 2005 | Statistical evaluation and comparison of a pairwise alignment algorithm that a priori assigns the number of gaps rather than employing gap penaltiesabstractMOTIVATION: Although pairwise sequence alignment is essential in comparative genomic sequence analysis, it has proven difficult to precisely determine the gap penalties for a given pair of sequences. A common practice is to employ default penalty values. However, there are a number of problems associated with using gap penalties. First, alignment results can vary depending on the gap penalties, making it difficult to explore appropriate parameters. Second, the statistical significance of an alignment score is typically based on a theoretical model of non-gapped alignments, which may be misleading. Finally, there is no way to control the number of gaps for a given pair of sequences, even if the number of gaps is known in advance. RESULTS: In this paper, we develop and evaluate the performance of an alignment technique that allows the researcher to assign a priori set of the number of allowable gaps, rather than using gap penalties. We compare this approach with the Smith-Waterman and Needleman-Wunsch techniques on a set of structurally aligned protein sequences. We demonstrate that this approach outperforms the other techniques, especially for short sequences (56-133 residues) with low similarity (<25%). Further, by employing a statistical measure, we show that it can be used to assess the quality of the alignment in relation to the true alignment with the associated optimal number of gaps. AVAILABILITY: The implementation of the described methods SANK_AL is available at http://cbbc.murdoch.edu.au/ CONTACT: [email protected]. Yasuyuki Nozaki, Matthew I. Bellgard |
Bioinform. | 2 |
| 2004 | GRID-enabled bioinformatics applications for comparative genomic analysis at the CBBCabstractSummary form only given. Bioinformatics is an important application area for grid computing. The grid computing issues required to tackle current bioinformatics challenges include processing power, large-scale data access and management, security, application integration, data integrity and curation, control/automation/tracking of workflows, data format consistency and resource discovery. In this poster, we describe preliminary steps taken to develop a grid environment to advance bioinformatics research. We developed a system called Grendel, with the aims of providing bioinformatics researchers transparent access to basic computational resources used in their research. Grendel is a platform and language independent Web-services based system for distributed resource management utilising Sun Grid Engine that provides a single entry point for computational tasks while keeping the actual resources transparent to the user. Grendel is developed in Java and deployed using the Tomcat. Client libraries have been developed in Perl and Java to provide access to computation resource exported via Grendel. Adam Hunter, David Schibeci, Hong Liang Hiew, Matthew I. Bellgard |
CLUSTER | 4 |
| 2003 | MASV - Multiple (BLAST) Annotation System ViewerabstractUNLABELLED: Multiple (BLAST) Annotation System Viewer (MASV) is a tool designed to aid in the annotation of genomic sequences. MASV enables the researcher to compare and analyse differences in annotation and analysis, resulting from changes in databases, analysis program parameters and results. This provides a unique capability for the user to conduct further bioinformatics analysis from the information obtained. AVAILABILITY: http://cbbc.murdoch.edu.au/projects/masv/ Kim Carter, Matthew I. Bellgard |
Bioinform. | 2 |
| 1999 | ORBIT: an integrated environment for user-customized bioinformatics toolsabstractMOTIVATION: There are a large number of computational programs freely available to bioinformaticians via a client/server, web-based environment. However, the client interface to these tools (typically an html form page) cannot be customized from the client side as it is created by the service provider. The form page is usually generic enough to cater for a wide range of users. However, this implies that a user cannot set as 'default' advanced program parameters on the form or even customize the interface to his/her specific requirements or preferences. Currently, there is a lack of end-user interface environments that can be modified by the user when accessing computer programs available on a remote server running on an intranet or over the Internet. RESULTS: We have implemented a client/server system called ORBIT (Online Researcher's Bioinformatics Interface Tools) where individual clients can have interfaces created and customized to command-line-driven, server-side programs. Thus, Internet-based interfaces can be tailored to a user's specific bioinformatic needs. As interfaces are created on the client machine independent of the server, there can be different interfaces to the same server-side program to cater for different parameter settings. The interface customization is relatively quick (between 10 and 60 min) and all client interfaces are integrated into a single modular environment which will run on any computer platform supporting Java. The system has been developed to allow for a number of future enhancements and features. ORBIT represents an important advance in the way researchers gain access to bioinformatics tools on the Internet. Matthew I. Bellgard, Hong Liang Hiew, Adam Hunter, Michael Wiebrands |
Bioinform. | 1 |
| 1994 | Harmonizing Music the Boltzmann WayabstractMusic harmonization has long been recognized as a highly intellectual process. Musicologists have studied music pieces by great composers and formulated a number of symbolic rules. However, these rules usually form only a set of heuristics and may not be absolutely precise. In this paper, we demonstrate how to train a Boltzmann machine to capture these syntactic rules and use it to construct an effective Boltzmann machine (EBM) to harmonize some unseen pieces. We have also incorporated ways to apply absolute constraints to the completion process. Our experiments demonstrate that using an EBM, ‘good’ harmonies can be non-deterministically synthesized along with a relative measure of their quality. Matthew I. Bellgard, Chi Ping Tsang |
Connect. Sci. | 1 |