Vote for your favorite mineral in #MinCup25! - Taenite vs. Nontronite
It's a mineral found mostly in the farthest reaches of space vs one so common an exhaustive list of localities is nigh impossible as alloy #taenite faces off against clay #nontronite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Amir, Amihood, Keselman, Dmitry (1997) Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM Journal on Computing, 26 (6). 1656-1669 doi:10.1137/s0097539794269461

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleMaximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
JournalSIAM Journal on Computing
AuthorsAmir, AmihoodAuthor
Keselman, DmitryAuthor
Year1997 (December)Volume26
Issue6
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794269461Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240131Long-form Identifiermindat:1:5:11240131:7
GUID0
Full ReferenceAmir, Amihood, Keselman, Dmitry (1997) Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM Journal on Computing, 26 (6). 1656-1669 doi:10.1137/s0097539794269461
Plain TextAmir, Amihood, Keselman, Dmitry (1997) Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM Journal on Computing, 26 (6). 1656-1669 doi:10.1137/s0097539794269461
In(1997, December) SIAM Journal on Computing Vol. 26 (6) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Cole, Richard, Farach-Colton, Martin, Hariharan, Ramesh, Przytycka, Teresa, Thorup, Mikkel (2000) An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. SIAM Journal on Computing, 30 (5). 1385-1404 doi:10.1137/s0097539796313477
Amir, Amihood, Benson, Gary (1998) Two-Dimensional Periodicity in Rectangular Arrays. SIAM Journal on Computing, 27 (1). 90-106 doi:10.1137/s0097539795298321
Whidden, Chris, Beiko, Robert G., Zeh, Norbert (2013) Fixed-Parameter Algorithms for Maximum Agreement Forests. SIAM Journal on Computing, 42 (4). 1431-1466 doi:10.1137/110845045
Attiya, Hagit, Fouren, Arie (2001) Adaptive and Efficient Algorithms for Lattice Agreement and Renaming. SIAM Journal on Computing, 31 (2). 642-664 doi:10.1137/s0097539700366000
Amir, Amihood, Aumann, Yonatan, Lewenstein, Moshe, Porat, Ely (2006) Function Matching. SIAM Journal on Computing, 35 (5). 1007-1022 doi:10.1137/s0097539702424496
Gavril, Fănică (1972) Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM Journal on Computing, 1 (2). 180-187 doi:10.1137/0201013
Kao, Ming-Yang (1998) Tree Contractions and Evolutionary Trees. SIAM Journal on Computing, 27 (6). 1592-1616 doi:10.1137/s0097539795283504
Cheriyan, Joseph (1997) Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory. SIAM Journal on Computing, 26 (6). 1635-1655 doi:10.1137/s0097539793256223
MacKenzie, Philip D. (1997) The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM Journal on Computing, 26 (6). 1559-1580 doi:10.1137/s0097539791224030
Tarjan, Robert Endre, Trojanowski, Anthony E. (1977) Finding a Maximum Independent Set. SIAM Journal on Computing, 6 (3). 537-546 doi:10.1137/0206038
Koren, Gilad, Dar, Emanuel, Amir, Amihood (2000) The Power of Migration in Multiprocessor Scheduling of Real-Time Systems. SIAM Journal on Computing, 30 (2). 511-527 doi:10.1137/s0097539797326241
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 15, 2025 10:21:20
Go to top of page