| | |
| | |
Stat |
Members: 3645 Articles: 2'504'585 Articles rated: 2609
24 April 2024 |
|
| | | |
|
Article overview
| |
|
Minimum Entropy Aproach to Word Segmentation Problems | Bin Wang
; | Date: |
29 Aug 2000 | Subject: | Biological Physics; Data Analysis, Statistics and Probability; Statistical Mechanics | physics.bio-ph cond-mat.stat-mech physics.data-an q-bio | Abstract: | Given a sequence composed of a limit number of characters, we try to "read" it as a "text". This involves to segment the sequence into "words". The difficulty is to distinguish good segmentation from enormous number of random ones.Aiming at revealing the nonrandomness of the sequence as strongly as possible, by applying maximum likelihood method, we find a quantity called Segmentation Entropy that can be used to fulfill the duty. Contrary to commonplace where maximum entropy principle was applied to obtain good solution, we choose to {em minimize} the segmentation entropy to obtain good segmentation. The concept developed in this letter can be used to study the noncoding DNA sequences, e.g., for regulatory elements prediction, in eukaryote genomes. | Source: | arXiv, physics/0008232 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |