Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Main entry, C House, Coorparoo, Brisbane

North-west elevation. As seen from entry steps.

Main entry, William St, Neville Bonner Building, Brisbane

William St building-Riverside Expressway building junction.

Main Pavilion, Lake Weyba House, Sunshine Coast

As seen from West, looking towards front of main pavilion. Standard roller doors to clerestory.

Main pavilion, Lake Weyba House, Sunshine Coast

South-West elevation of main pavilion - living, kitchen, dining and study/guest areas.

A two-phase approach for detecting recombination in nucleotide sequences

Genetic recombination can produce heterogeneous phylogenetic histories within a set of homologous genes. Delineating recombination events is important in the study of molecular evolution, as inference of such events provides a clearer picture of the phylogenetic relationships among different gene sequences or genomes. Nevertheless, detecting recombination events can be a daunting task, as the performance of different recombination-detecting approaches can vary, depending on evolutionary events that take place after recombination. We recently evaluated the effects of post-recombination events on the prediction accuracy of recombination-detecting approaches using simulated nucleotide sequence data. The main conclusion, supported by other studies, is that one should not depend on a single method when searching for recombination events. In this paper, we introduce a two-phase strategy, applying three statistical measures to detect the occurrence of recombination events, and a Bayesian phylogenetic approach in delineating breakpoints of such events in nucleotide sequences. We evaluate the performance of these approaches using simulated data, and demonstrate the applicability of this strategy to empirical data. The two-phase strategy proves to be time-efficient when applied to large datasets, and yields high-confidence results.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Unlocking hidden genomic sequence

Despite the success of conventional Sanger sequencing, significant regions of many genomes still present major obstacles to sequencing. Here we propose a novel approach with the potential to alleviate a wide range of sequencing difficulties. The technique involves extracting target DNA sequence from variants generated by introduction of random mutations. The introduction of mutations does not destroy original sequence information, but distributes it amongst multiple variants. Some of these variants lack problematic features of the target and are more amenable to conventional sequencing. The technique has been successfully demonstrated with mutation levels up to an average 18% base substitution and has been used to read previously intractable poly(A), AT-rich and GC-rich motifs.

A two-phase strategy for detecting recombination in nucleotide sequences

Genetic recombination can produce heterogeneous phylogenetic histories within a set of homologous genes. Delineating recombination events is important in the study of molecular evolution, as inference of such events provides a clearer picture of the phylogenetic relationships among different gene sequences or genomes. Nevertheless, detecting recombination events can be a daunting task, as the performance of different recombination-detecting approaches can vary, depending on evolutionary events that take place after recombination. We previously evaluated the effects of post-recombination events on the prediction accuracy of recombination-detecting approaches using simulated nucleotide sequence data. The main conclusion, supported by other studies, is that one should not depend on a single method when searching for recombination events. In this paper, we introduce a two-phase strategy, applying three statistical measures to detect the occurrence of recombination events, and a Bayesian phylogenetic approach to delineate breakpoints of such events in nucleotide sequences. We evaluate the performance of these approaches using simulated data, and demonstrate the applicability of this strategy to empirical data. The two-phase strategy proves to be time-efficient when applied to large datasets, and yields high-confidence results.

Bellerophon: a program to detect chimeric sequences in multiple sequence alignments

Bellerophon is a program for detecting chimeric sequences in multiple sequence datasets by an adaption of partial treeing analysis. Bellerophon was specifically developed to detect 16S rRNA gene chimeras in PCR-clone libraries of environmental samples but can be applied to other nucleotide sequence alignments.

Sequence and tissue distribution of chicken cellular nucleic acid binding protein cDNA

We sequenced cDNAs coding for chicken cellular nucleic acid binding protein (CNBP). Two slightly different variations of the open reading frame were found, each of which translates into a protein with seven zinc finger domains. The longest transcript contains an in-frame insert of 3 bp. The sequence conservation between chick CNBP cDNAs with human, rat and mouse CNBP cDNAs is extreme, especially in the coding region, where the deduced amino acid sequence identity with human, rat and mouse CNBP is 99%. CNBP-like transcripts were also found in various tissues from insect, shrimp, fish and lizard. Regions with remarkable nucleotide conservation were also found in the 3' untranslated region, indicating important functions for these regions. Quantitative reverse transcription polymerase chain reaction (RT-PCR) indicated that in the chick, CNBP is present in all tissues examined in approximately equal ratios to total RNA. RT-PCR of total RNA isolated from different phyla indicate CNBP-like proteins art widespread throughout the animal kingdom. The extraordinary level of conservation suggests an important physiological role for CNBP. (C) 1997 Elsevier Science Inc.

Finite element analysis of steady-state natural convection problems in fluid-saturated porous media heated from below

In this paper, a progressive asymptotic approach procedure is presented for solving the steady-state Horton-Rogers-Lapwood problem in a fluid-saturated porous medium. The Horton-Rogers-Lapwood problem possesses a bifurcation and, therefore, makes the direct use of conventional finite element methods difficult. Even if the Rayleigh number is high enough to drive the occurrence of natural convection in a fluid-saturated porous medium, the conventional methods will often produce a trivial non-convective solution. This difficulty can be overcome using the progressive asymptotic approach procedure associated with the finite element method. The method considers a series of modified Horton-Rogers-Lapwood problems in which gravity is assumed to tilt a small angle away from vertical. The main idea behind the progressive asymptotic approach procedure is that through solving a sequence of such modified problems with decreasing tilt, an accurate non-zero velocity solution to the Horton-Rogers-Lapwood problem can be obtained. This solution provides a very good initial prediction for the solution to the original Horton-Rogers-Lapwood problem so that the non-zero velocity solution can be successfully obtained when the tilted angle is set to zero. Comparison of numerical solutions with analytical ones to a benchmark problem of any rectangular geometry has demonstrated the usefulness of the present progressive asymptotic approach procedure. Finally, the procedure has been used to investigate the effect of basin shapes on natural convection of pore-fluid in a porous medium. (C) 1997 by John Wiley & Sons, Ltd.

Nucleotide sequence of the nifH gene coding for nitrogen reductase in the acetic acid bacterium Acetobacter diazotrophicus

The nifH gene sequence of the nitrogen-fixing bacterium Acetobacter diazotrophicus was determined with the use of the polymerase chain reaction and universal degenerate oligonucleotide primers. The gene shows highest pair-wise similarity to the nifH gene of Azospirillum brasilense. The phylogenetic relationships of the nifH gene sequences were compared with those inferred from 16S rRNA gene sequences. Knowledge of the sequence of the nifH gene contributes to the growing database of nifH gene sequences, and will allow the detection of Acet. diazotrophicus from environmental samples with nifH gene-based primers.

Molecular cloning and sequence of the ovine gastrin gene

A clone encoding ovine preprogastrin was isolated from a sheep genomic library. The deduced 104 amino acid sequence of ovine preprogastrin was 92% and 68% identical to the sequences of bovine and human preprogastrin, respectively. While the similarity was greatest in the gastrin-17 sequence, an unexpected similarity was also observed in the N-terminus of mature progastrin.