We're a little bit different from other sites. Here's how:
This site is all about getting answers. It's not a discussion forum. There's no chit-chat.
Just questions...
...and answers.
Good answers are voted up and rise to the top.
The best answers show up first so that they are always easy to find.
The person who asked can mark one answer as "accepted".
Accepting doesn't mean it's the best answer, it just means that it worked for the person who asked.
I understand that rooted and unrooted phylogenetic trees are similar in structure
But how can they be easily identified as one or the other?
Is it simply based on the presence or lack of a named root (the root is identified as a particular ancestor) or outgroup?
In case of a drawn figure, either look for the a short stem to the left, or for an explicitly labelled outgroup. Trees derived from phylogenetic analyses are normally unrooted by default, you need to root them by either making an arbitrary (but hopefully informed) decision or by adding an outgroup.
Trees can not be distinguished from each other because every unrooted tree can be made rooted by adding a root and vice versa by deletion.
If you mean dendrograms... the root is always the one node where the distance to each leaf is the same. But I don't know of an unrooted dendrogram.
Focus on questions about an actual problem you have faced. Include details about what you have tried and exactly what you are trying to do.
Ask about...
Not all questions work well in our format. Avoid questions that are primarily opinion-based, or that are likely to generate discussion rather than answers.
Questions that need improvement may be closed until someone fixes them.
Don't ask about...
All questions are tagged with their subject areas. Each can have up to 5 tags, since a question might be related to several subjects.
Click any tag to see a list of questions with that tag, or go to the tag list to browse for topics that interest you.
I understand that rooted and unrooted phylogenetic trees are similar in structure
But how can they be easily identified as one or the other?
Is it simply based on the presence or lack of a named root (the root is identified as a particular ancestor) or outgroup?
Your reputation score goes up when others vote up your questions, answers and edits.
As you earn reputation, you'll unlock new privileges like the ability to vote, comment, and even edit other people's posts.
| Reputation | Privilege |
|---|---|
| 15 | Vote up |
| 50 | Leave comments |
| 125 | Vote down (costs 1 rep on answers) |
At the highest levels, you'll have access to special moderation tools. You'll be able to work alongside our community moderators to keep the site focused and helpful.
| 2000 | Edit other people's posts |
|---|---|
| 3000 | Vote to close, reopen, or migrate questions |
| 10000 | Access to moderation tools |
Our goal is to have the best answers to every question, so if you see questions or answers that can be improved, you can edit them.
Use edits to fix mistakes, improve formatting, or clarify the meaning of a post.
In case of a drawn figure, either look for the a short stem to the left, or for an explicitly labelled outgroup. Trees derived from phylogenetic analyses are normally unrooted by default, you need to root them by either making an arbitrary (but hopefully informed) decision or by adding an outgroup.
Badges are special achievements you earn for participating on the site. They come in three levels: bronze, silver, and gold.
| Student | First question with score of 1 or more |
| Editor | First edit |
| Good Answer | Answer score of 25 or more |
| Civic Duty | Vote 300 or more times |
| Famous Question | Question with 10,000 views |
Signing up allows you to:
Like this site? Stack Exchange is a network of 174 Q&A sites just like it. Check out the full list of sites.
Use comments to ask for more information or clarify a question or answer.
You can always comment on your own questions and answers. Once you earn 50 reputation, you can comment on anybody's post.
Remember: we're all here to learn, so be friendly and helpful!