Sciweavers

169 search results - page 20 / 34
» Reduced Length Checking Sequences
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
13 years 7 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
ICASSP
2009
IEEE
14 years 2 months ago
Affine invariant features and their application to speech recognition
This paper proposes a set of affine invariant features (AIFs) for sequence data. The proposed AIFs can be calculated directly from the sequence data, and their invariance to af...
Yu Qiao, Masayuki Suzuki, Nobuaki Minematsu
BMCBI
2008
86views more  BMCBI 2008»
13 years 7 months ago
Is plant mitochondrial RNA editing a source of phylogenetic incongruence? An answer from in silico and in vivo data sets
Background: In plant mitochondria, the post-transcriptional RNA editing process converts C to U at a number of specific sites of the mRNA sequence and usually restores phylogeneti...
Ernesto Picardi, Carla Quagliariello
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
14 years 27 days ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
BMCBI
2010
81views more  BMCBI 2010»
13 years 7 months ago
Empirical Bayes Analysis of Sequencing-based Transcriptional Profiling without Replicates
Background: Recent technological advancements have made high throughput sequencing an increasingly popular approach for transcriptome analysis. Advantages of sequencing-based tran...
Zhijin Wu, Bethany D. Jenkins, Tatiana A. Rynearso...