Sciweavers

1813 search results - page 188 / 363
» Constraint Based Methods for Biological Sequence Analysis
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
ICONFERENCE
2011
14 years 11 months ago
The structure of collaborative problem solving in a virtual math team
To develop a science of small-group interaction in groupware, we need a method for analyzing the structure of computer-mediated discourse. Conversation analysis offers an analysis...
Gerry Stahl
ICALP
2001
Springer
15 years 9 months ago
Hidden Pattern Statistics
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpank...
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 8 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
JCB
2007
108views more  JCB 2007»
15 years 4 months ago
A Dynamic Programming Approach for Finding Common Patterns in RNAs
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
Sven Siebert, Rolf Backofen