Signal analysis and classification methods for the calcium transient data of stem cell-derived cardiomyocytes.

Calcium cycling is crucial in the excitation-contraction coupling of cardiomyocytes, and therefore has a key role in cardiac functionality. Cardiac disorders and different drugs alter the calcium transients of cardiomyocytes and can cause serious dysfunction of the heart. New insights into this biochemical phenomena can be achieved by studying and analyzing calcium transients. Calcium transients of spontaneously beating human induced pluripotent stem cell-derived cardiomyocytes were recorded for a data set of 280 signals. Our objective was to develop and program procedures: (1) to automatically detect cycling peaks from signals and to classify the peaks of signals as either normal or abnormal, and (2) on the basis of the preceding peak detection results, to classify the entire signals into either a normal class or an abnormal class. We obtained a classification accuracy of approximately 80% compared to class decisions made separately by an experienced researcher, which is promising for the further development of an automatic classification approach. Automated classification software would be beneficial in the future for analyzing cardiomyocyte functionality on a large scale when screening for the adverse cardiac effects of new potential compounds, and also in future clinical applications.

On computation of calcium cycling anomalies in cardiomyocytes data.

Induced pluripotent stem cell (iPSC) lines derived from skin fibroblasts of patients suffering from cardiac disorders were differentiated to cardiomyocytes and used to generate a data set of Ca(2+) transients of 136 recordings. The objective was to separate normal signals for later medical research from abnormal signals. We constructed a signal analysis procedure to detect peaks representing calcium cycling in signals and another procedure to classify them into either normal or abnormal peaks. Using machine learning methods we classified signals into normal or abnormal signals on the basis of peak findings in them. We compared classification results obtained to those made visually by an expert biotechnologist who assessed the signals independent of the computer method. Classification accuracies of around 85% indicated high congruence between two modes denoting the high capability and usefulness of computer based processing for the present data.

Genome-wide selection of unique and valid oligonucleotides.

Functional genomics methods are used to investigate the huge amount of information contained in genomes. Numerous experimental methods rely on the use of oligo- or polynucleotides. Nucleotide strand hybridization forms the underlying principle for these methods. For all these techniques, the probes should be unique for analyzed genes. In addition to being unique for the studied genes, the probes should fulfill a large number of criteria to be usable and valid. The criteria include for example, avoidance of self-annealing, suitable melting temperature and nucleotide composition. We developed a method for searching unique and valid oligonucleotides or probes for genes so that there is not even a similar (approximate) occurrence in any other location of the whole genome. By using probe size 25, we analyzed 17 complete genomes representing a wide range of both prokaryotic and eukaryotic organisms. More than 92% of all the genes in the investigated genomes contained valid oligonucleotides. Extensive statistical tests were performed to characterize the properties of unique and valid oligonucleotides. Unique and valid oligonucleotides were relatively evenly distributed in genes except for the beginning and end, which were somewhat overrepresented. The flanking regions in eukaryotes were clearly underrepresented among suitable oligonucleotides. In addition to distributions within genes, the effects on codon and amino acid usage were also studied.

On exact string matching of unique oligonucleotides.

Unique, gene-specific oligonucleotides are used for many genetic investigations such as polymerase chain reaction, gene cloning, microarray technology and antisense DNA studies. It is a computationally demanding task to extract these oligonucleotides from DNA databases. We studied the problem from the point of view of the string matching problem. We implemented and tested several exact string matching algorithms and modified the implementations to be as effective as possible. Ten different implementations were tested on yeast genomic sequence data. The run times for the best algorithms were significantly improved compared to conventional approaches, while in principle, i.e. in respect of theoretical time complexity, these algorithms do not actually differ essentially from each other.

An O(N2) algorithm for discovering optimal Boolean pattern pairs.

We consider the problem of finding the optimal combination of string patterns, which characterizes a given set of strings that have a numeric attribute value assigned to each string. Pattern combinations are scored based on the correlation between their occurrences in the strings and the numeric attribute values. The aim is to find the combination of patterns which is best with respect to an appropriate scoring function. We present an O(N2) time algorithm for finding the optimal pair of substring patterns combined with Boolean functions, where N is the total length of the sequences. The algorithm looks for all possible Boolean combinations of the patterns, e.g., patterns of the form p and not q, which indicates that the pattern pair is considered to occur in a given string s, if p occurs in s, AND q does NOT occur in s. An efficient implementation using suffix arrays is presented, and we further show that the algorithm can be adapted to find the best k-pattern Boolean combination in O(Nk) time. The algorithm is applied to mRNA sequence data sets of moderate size combined with their turnover rates for the purpose of finding regulatory elements that cooperate, complement, or compete with each other in enhancing and/or silencing mRNA decay.