Sciweavers

1736 search results - page 177 / 348
» String Extension Learning
Sort
View
ALMOB
2008
131views more  ALMOB 2008»
15 years 6 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2008
145views more  BMCBI 2008»
15 years 6 months ago
Directed acyclic graph kernels for structural RNA analysis
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
Kengo Sato, Toutai Mituyama, Kiyoshi Asai, Yasubum...
BMCBI
2007
176views more  BMCBI 2007»
15 years 6 months ago
The Firegoose: two-way integration of diverse data from different bioinformatics web resources with desktop applications
Background: Information resources on the World Wide Web play an indispensable role in modern biology. But integrating data from multiple sources is often encumbered by the need to...
J. Christopher Bare, Paul T. Shannon, Amy K. Schmi...
BMCBI
2008
85views more  BMCBI 2008»
15 years 6 months ago
Normalizing biomedical terms by minimizing ambiguity and variability
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
Yoshimasa Tsuruoka, John McNaught, Sophia Ananiado...
JCB
2007
118views more  JCB 2007»
15 years 6 months ago
Discovering Topological Motifs Using a Compact Notation
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
Laxmi Parida